By Topic

A Computationally Efficient Path Planner for a Collection of Wheeled Mobile Robots with Limited Sensing Zones

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
$33 $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

2 Author(s)
Turker Sahin ; Department of Computer Engineering, Gebze Institute of Technology, PK. 141, 41400 Gebze/Kocaeli-Turkey. htsahin@bilmuh.gyte.edu.tr ; Erkan Zergeroglu

Path planning for formations of wheeled mobile robots (WMRs) has been an active research topic of robotics in the recent years. The methods of route generation for WMRs usually utilize complex algorithms, which require global information of the workspace or mapping of the nearby environment. Hence they are not very efficient for formation based motion of large collections of small entry-level agents. In this work a path generation method is developed for synthesizing non-holonomic paths for small unicycle WMRs, and then is integrated into simple geometrical formations for extension to navigation of relatively large groups of small agents. Our technique is based on a computationally low-cost algorithm; and works effectively for transfer of many robots in obstacle cluttered environments. The efficiency of our technique is verified by simulation results.

Published in:

Proceedings 2007 IEEE International Conference on Robotics and Automation

Date of Conference:

10-14 April 2007