Results 131 to 140 of about 15,243 (168)
IEEE Transactions on Vehicular Technology, 2020 Underwater gliders are being increasingly used for data collection, and the development of methods for optimizing their routes has become a topic of active research.
Guangjie Han, Tongwei Zhang, Hao Wang
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Hybrid path planning methods for complete coverage in harvesting operation scenarios
Computers and Electronics in AgricultureNing Wang 0041 +7 more
exaly +2 more sources
Complete Coverage Path Planning for Intelligent Sweeping Robot
2021 IEEE Asia-Pacific Conference on Image Processing, Electronics and Computers (IPEC), 2021As a universal optimization problem in automatic control, complete coverage path planning is one of the useful functions for intelligent sweeping robot, which makes sweeping robot complete sweeping more quickly and efficiently. Though conventional unit decomposition method has got solution, excessive decomposition for complex concave polygon ...
Bing Luo +4 more
openaire +1 more source
On the Complete Coverage Path Planning for Mobile Robots
Journal of Intelligent & Robotic Systems, 2013This paper presents a generalized complete coverage path planning (CCPP) algorithm and its implementation for a mobile robot. The proposed planner contains two concerns: 1) low working time or low energy consumption, and 2) high human safety. For the first concern, we design the optimal path by incorporating two factors: time and energy costs ...
Ping-Min Hsu +2 more
openaire +1 more source
Complete coverage path planning for road cleaning robot
2010 International Conference on Networking, Sensing and Control (ICNSC), 2010This paper introduces the principle of biologically inspired neural network and analyzes the deficiency of this algorithm. Then, the road edge recognition algorithm and both static and moving obstacles detection method are described. On the basis of comparing the differences between indoor full coverage cleaning and outdoor, some improved full coverage
Guoqing Hu, Zhengwei Hu, Hongbo Wang
openaire +1 more source
An Improved A-Star Algorithm for Complete Coverage Path Planning of Unmanned Ships
International Journal of Pattern Recognition and Artificial Intelligence, 2022Aiming at the low efficiency and high energy consumption of unmanned ships traversing the entire area, a complete coverage path planning algorithm based on the improved A-star algorithm is proposed. The positioning and vision systems of unmanned ships are used to digitize the actual water information, and the grid method is used to convert the ...
Bo Guo 0001 +5 more
openaire +1 more source
A Probabilistic Approach for Complete Coverage Path Planning with low-cost Systems
2021 European Conference on Mobile Robots (ECMR), 2021Domestic robots, such as vacuum cleaners or lawn mowers, are mostly based on a low-cost design to make them affordable for the consumer. This often results in such robots being equipped with only simple sensors, such as in-/outside area detectors for lawn mowers.
Nils Rottmann +3 more
openaire +1 more source
A Rolling Method for Complete Coverage Path Planning in Uncertain Environments
2004 IEEE International Conference on Robotics and Biomimetics, 2005Motion planning with obstacles avoidance in uncertain environments is an essential issue in robotics. Complete coverage path planning of a mobile robot requires the robot to pass through every area in the workspace with collision-free, which has many applications, e.g., various cleaning robots, painter robots, automated harvesters, land mine detectors ...
Xuena Qiu, Shirong Liu, Simon X. Yang
openaire +1 more source
A solution to vicinity problem of obstacles in complete coverage path planning
Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292), 2003In real world applications there exist arbitrarily shaped obstacles in the workspace during complete coverage path planning of cleaning robots. A cleaning robot should be able to sweep in a variety of corners and in the vicinity of arbitrarily shaped obstacles in an indoor environment.
Chaomin Luo +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, 2010This 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