Results 231 to 240 of about 316,139 (262)

Complete coverage path planning algorithm for known 2d environment

2017 2nd IEEE International Conference on Recent Trends in Electronics, Information & Communication Technology (RTEICT), 2017
Path-planning is an important primitive for autonomous mobile robots that lets robots find the optimal path between two points. Typical path-planning algorithms deal with finding an optimized path from start to end using a map of the environment and the robot to be aware of its location with respect to the map. Complete coverage path planning algorithm,
Sumit Gajjar, Jaydeep Bhadani, Pramit Dutta, Naveen Rastogi   +3 more
openaire   +1 more source

An Effective Method for Complete Visual Coverage Path Planning

2010 Third International Joint Conference on Computational Science and Optimization, 2010
This paper addresses the complete visual coverage path planning problem in raster terrain and presents an effective solution with hierarchy based on multiple observers siting and an evolutionary path planning algorithm. The main idea of the method is to get a nearly optimal complete visual coverage path by connecting all of the observers in the visual ...
Jie Li, Changwen Zheng, Xiaohui Hu
openaire   +1 more source

Complete Coverage Path Planning Based on Ant Colony Algorithm

2008 15th International Conference on Mechatronics and Machine Vision in Practice, 2008
The complete coverage path planning algorithm integrating local subarea coverage with global planning was proposed. According to the characteristic of Boustrophedon cellular decomposition, the robot covers local subarea through back and forth motion.
Zhang Chibin, Wang Xingsong, Du Yong
openaire   +1 more source

Online complete coverage path planning using two-way proximity search

Intelligent Service Robotics, 2017
This paper presents an efficient online approach for complete coverage path planning of mobile robots in an unknown workspace based on online boustrophedon motion and an optimized backtracking mechanism. The presented approach first performs a single continuous boustrophedon motion until a critical point is reached.
Amna Khan, Iram Noreen, Hyejeong Ryu, Nakju Lett Doh, Zulfiqar Habib   +4 more
openaire   +1 more source

Complete coverage path planning for cleaning task using multiple robots

2009 IEEE International Conference on Systems, Man and Cybernetics, 2009
This paper proposes a novel path planning method for cleaning task using multiple robots in large environment. To do so, we suggested algorithm which partitions a given region into several smaller regions and plans the covering path which can completely cover these divided areas.
Jeong H. Lee, Jeong S. Choi, Beom H. Lee, Kong W. Lee   +3 more
openaire   +1 more source

Complete Coverage Path Planning for Flexible Parent-Child Unit Robots

Volume 3: Multiagent Network Systems; Natural Gas and Heat Exchangers; Path Planning and Motion Control; Powertrain Systems; Rehab Robotics; Robot Manipulators; Rollover Prevention (AVS); Sensors and Actuators; Time Delay Systems; Tracking Control Systems; Uncertain Systems and Robustness; Unmanned, Ground and Surface Robotics; Vehicle Dynamics Control; Vibration and Control of Smart Structures/Mech Systems; Vibration Issues in Mechanical Systems, 2015
This paper presents a complete coverage algorithm for a flexible parent child unit robot by combining input shaping with the wavefront algorithm. Input shaping was used to control the command-induced vibration in the system, while the wavefront algorithm planned the complete coverage path for a given workspace.
Dare Olaonipekun, Joshua Vaughan
openaire   +1 more source

Complete, Decomposition-Free Coverage Path Planning

2022 IEEE 18th International Conference on Automation Science and Engineering (CASE), 2022
Tushar Kusnur, Maxim Likhachev
openaire   +1 more source

Complete coverage path planning for multi-robots employing flow networks

2008 International Conference on Control, Automation and Systems, 2008
This paper describes a path planning algorithm, which is the minimal turning path based on the shape and size of the cell to clean up the whole area with two cleaning robots. Our method divides the whole cleaning area with each cell by cellular decomposition, and then provides some path plans among of the robots to reduce the rate of energy consumption
null Sang-Hyun Nam, null Ik-Sang Shin, null Jae-Jun Kim, null Soon-Geul Lee   +3 more
openaire   +1 more source

Multi-robot Path Planning for Complete Coverage with Genetic Algorithms

2019
Complete coverage path planning (CPP) generates a path following which a robot can cover all free spaces in an environment. Compared with single robot CPP, multi-robot CPP gains both efficiency and challenges. In large scale environments, one robot is not competent to the coverage task, such as doing cleaning work in airports, supermarkets, shopping ...
Rongchuan Sun, Chunhua Tang, Jianying Zheng, Yongzheng Zhou, Shumei Yu   +4 more
openaire   +1 more source

Complete Coverage Path Planning of Wall-Cleaning Robot Using Visual sensor

2007 8th International Conference on Electronic Measurement and Instruments, 2007
A design and implication of a complete coverage path planning system based on visual sensor for wall-climbing robot is proposed in this paper. The visual sensor composed of an oriented CCD camera and two laser diodes helps robot align with walls and keep the robot stay in the planned path.
Wang Meiting, Tan Shili Ding Junjian, Yan Liwen   +2 more
openaire   +1 more source