Design and implementation of an efficient path planning algorithm for networked robots
Abstract
References
- Design and implementation of an efficient path planning algorithm for networked robots
Recommendations
Ant colony based path planning for swarm robots
AIR '15: Proceedings of the 2015 Conference on Advances In RoboticsA Swarm Robotic System consists of a number of robots working together and coordinating like a team. In these systems, the real time navigation and coordination throughout the workspace is the major task and path planning for swarm robots plays a major ...
A novel collaborative path planning algorithm for 3-wheel omnidirectional Autonomous Mobile Robot
AbstractCollaboration of multiple mobile robots becomes important in situations where collaborative tasks are required. For this purpose, a method including obstacle detection based on collaborative path planning of multiple Autonomous Mobile Robots (...
Graphical abstractDisplay Omitted
Highlights- The most efficient collision-free trajectory planning for collaborative mobile robots.
- Path planning and obstacle avoidance algorithm at the safe following distance.
- Path planning of collaborative autonomous omnidirectional mobile ...
Mobile robots path planning
Electrostatic potential field theory is used to solve robots path planning problem.All obstacles features are integrated into a scalar potential field to make decision.Collision-free and fast approaching objectives are achieved via an optimization.Using ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 132Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in