Multirobot rendezvous with visibility sensors in nonconvex environments

Details Multirobot rendezvous with visibility sensors in nonconvex environments Multirobot rendezvous with visibility sensors in nonconvex environments

2006-11-06

arxiv.org/abs/cs/0611022v1

Computer Science

Robotics

21 pages

Scientific paper

This paper presents a coordination algorithm for mobile autonomous robots. Relying upon distributed sensing the robots achieve rendezvous, that is, they move to a common location. Each robot is a point mass moving in a nonconvex environment according to an omnidirectional kinematic model. Each robot is equipped with line-of-sight limited-range sensors, i.e., a robot can measure the relative position of any object (robots or environment boundary) if and only if the object is within a given distance and there are no obstacles in-between. The algorithm is designed using the notions of robust visibility, connectivity-preserving constraint sets, and proximity graphs. Simulations illustrate the theoretical results on the correctness of the proposed algorithm, and its performance in asynchronous setups and with sensor measurement and control errors.

Affiliated with

Also associated with

No associations

Rating

Multirobot rendezvous with visibility sensors in nonconvex environments does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multirobot rendezvous with visibility sensors in nonconvex environments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multirobot rendezvous with visibility sensors in nonconvex environments will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-297203