By Topic

A colored Petri net based strategy for multi-agent scheduling

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Quan Bai ; Sch. of IT & Comput. Sci., Wollongong Univ., Australia ; Minjie Zhang ; Haijun Zhang

In the last decade, the focus of agent research has shifted from single agent systems to multi-agent systems (MASs). Dynamic agent coordination is one of the challenge problems of multi-agent research. One coordination problem is how to achieve agent scheduling under open dynamic environments. Petri nets (PNs) and colored Petri nets (CPNs) are system study tools that provide an appropriate mathematical formalism for the description, construction and analysis of distributed and concurrent systems. In this paper, we present a CPN based strategy to schedule and allocate new tasks to suitable agent(s) or agent combinations. In this strategy, through using CPNs to represent the dynamic statuses of agents, agent coordinators are able to check concurrent agent statuses and make correct and optimal decisions.

Published in:

Rational, Robust, and Secure Negotiation Mechanisms in Multi-Agent Systems, 2005

Date of Conference:

25 July 2005