The Problems

 

McGill Center for Intelligent Machines
Room 436 [Scott Burlington]scottyb@cs.mcgill.ca

 

Abstract:

This paper looks at the problem of searching the plane for an object with multiple agents, in co-ordinated search. Also the problem of how to deal with noise within the context of Fakete's [3] Kissing Circles algorithm is addressed and a method of coping is conjectured.

The relative performance of a family of rendezvous search algorithms for multi-agent search in the plane. Some very strict assumptions have been made to idealize the circumstance in order to simplify the analysis.

 

 

Semi-Planar Performance Analysis and
Kissing Circle Sensitivity

Scott Burlington

 

April 8, 1998

 

• The Problems
• Semi-Planar Rendezvous Search Recast as a Synchronization Problem in Parallel Breadth-First Search
• Rendezvous Search in the Plane
• A Competitive Ratio Examination
• Bounded Distances
• Deviation on Kissing Circles
• Future Investigations
• References
• About this document ...