By Topic

A net-based approach to the synthesis of nondeterministic robot plans

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

1 Author(s)
Bahler, D.R. ; Dept. of Comput. Sci., North Carolina State Univ., Raleigh, NC, USA

A technique is discussed for both representing and automatically synthesizing high-level multirobot plans through the use of generalized condition/event (GC/E) nets. An example is given of the functionality of the approach for representing and solving problems of resource allocation in environments containing more than one agent. An important property of nets called persistence, which is essential to multiagent plans, is identified. Persistence, of allowed suborderings of events must be preserved by any net-growing algorithm that produces a plan involving nondeterministic mutual exclusion

Published in:

Robotics and Automation, 1988. Proceedings., 1988 IEEE International Conference on

Date of Conference:

24-29 Apr 1988