ICRA 2012 Paper Abstract

Close

Paper TuD05.5

Krontiris, Athanasios (University of Nevada, Reno), Louis, Sushil (University of Nevada, Reno), Bekris, Kostas E. (University of Nevada, Reno)

Multi-Level Formation Roadmaps for Collision-Free Dynamic Shape Changes with Non-holonomic Teams

Scheduled for presentation during the Regular Session "Multi-Robot Systems II" (TuD05), Tuesday, May 15, 2012, 17:30−17:45, Meeting Room 5 (Ska)

2012 IEEE International Conference on Robotics and Automation, May 14-18, 2012, RiverCentre, Saint Paul, Minnesota, USA

This information is tentative and subject to change. Compiled on December 13, 2017

Keywords Path Planning for Multiple Mobile Robots or Agents

Abstract

Teams of robots can utilize formations to accomplish a task, such as maximizing the observability of an environment while maintaining connectivity. In a cluttered space, however, it might be necessary to automatically change formation to avoid obstacles. This work proposes a path planning approach for non-holonomic robots, where a team dynamically switches formations to reach a goal without collisions. The method introduces a multi-level graph, which can be constructed offline. Each level corresponds to a different formation and edges between levels allow for formation transitions. All edges satisfy curvature bounds and clearance requirements from obstacles. During the online phase, the method returns a path for a virtual leader, as well as the points along the path where the team should switch formations. Individual agents can compute their controls using kinematic formation controllers that operate in curvilinear coordinates. The approach guarantees that it is feasible for the agents to follow the trajectory returned. Simulations show that the online cost of the approach is small. The method returns solutions that maximize the maintenance of a desired formation while allowing the team to rearrange its configuration in the presence of obstacles.

 

 

Technical Content © IEEE Robotics & Automation Society

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2017 PaperCept, Inc.
Page generated 2017-12-13  22:09:13 PST  Terms of use