Results 141 to 150 of about 15,243 (168)
Spiral complete coverage path planning based on conformal slit mapping in multi-connected domains
International Journal of Robotics ResearchThe generation of smoother and shorter spiral complete coverage paths in multi-connected domains is a crucial research topic in path planning for robotic cavity machining and other related fields.
Xiaojian Zhang +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Complete coverage path planning and guidance for cleaning robots
ISIE '97 Proceeding of the IEEE International Symposium on Industrial Electronics, 2002This paper describes a complete coverage path planning and guidance methodology for a mobile robot, having the automatic floor cleaning of large industrial areas as a target application. The proposed algorithms rely on the a priori knowledge of a 2D map of the environment and cope with unexpected obstacles not represented on the map.
R.N. De Carvalho +3 more
openaire +1 more source
Complete coverage path planning for cleaning task using multiple robots
2009 IEEE International Conference on Systems, Man and Cybernetics, 2009This 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 Hee Lee +3 more
openaire +1 more source
Multi-robot Path Planning for Complete Coverage with Genetic Algorithms
2019Complete 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 +4 more
openaire +1 more source
Complete Coverage Path Planning for arbitrary number of Unmanned Aerial Vehicles
Proceedings of the 9th ACM International Conference on PErvasive Technologies Related to Assistive Environments, 2016In this paper we study the problem of complete path coverage planning for a set of Unmanned Aerial Vehicles (UAVs) in urban environments. The geographical area we aim to cover is represented as a grid of cells with no holes and the center of every cell in this grid represents a node.
Dimitris Dedousis, Vana Kalogeraki
openaire +1 more source
Complete, Decomposition-Free Coverage Path Planning
2022 IEEE 18th International Conference on Automation Science and Engineering (CASE), 2022Tushar Kusnur, Maxim Likhachev
openaire +1 more source
Complete Coverage Path Planning Based on Ant Colony Algorithm
2008 15th International Conference on Mechatronics and Machine Vision in Practice, 2008The 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
Path Planning for Complete and Efficient Coverage Operation of Mobile Robots
2007 International Conference on Mechatronics and Automation, 2007This paper presents a complete and efficient coverage path planning method for mobile robots. Its applications include robots for de-mining, cleaning, painting and so on. When a mobile robot performs area coverage task, completeness and efficiency of coverage are important factors. To achieve completeness easily, we adopt a divide and conquer strategy.
Jung Won Kang +5 more
openaire +1 more source
Complete coverage path planning algorithm for known 2d environment
2017 2nd IEEE International Conference on Recent Trends in Electronics, Information & Communication Technology (RTEICT), 2017Path-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 +3 more
openaire +1 more source
Complete Coverage Path Planning for Industrial Mobile Robots
Proceedings of the 2022 4th International Conference on Robotics, Intelligent Control and Artificial Intelligence, 2022Ao Jiang +4 more
openaire +1 more source