Abstract
Suppose there are two robots trying to meet in a fairly complex maze: one is starting from the entrance and the other from the exit. Each robot always knows its current location in the maze, and can communicate with the other robot; thus, each robot always knows its goal location. Even though the robots do not have a map of the maze, they can gather information around them through various sensors.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1997 Kluwer Academic Publishers
About this chapter
Cite this chapter
(1997). Cooperating in Uncertain Situations. In: Real-Time Search for Learning Autonomous Agents. The Springer International Series in Engineering and Computer Science, vol 406. Springer, Boston, MA. https://doi.org/10.1007/978-0-585-34507-9_4
Download citation
DOI: https://doi.org/10.1007/978-0-585-34507-9_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-9944-5
Online ISBN: 978-0-585-34507-9
eBook Packages: Springer Book Archive