Development of Navigation System for Path Planning of Autonomous Cleaning Robot

Author(s):  
Minh-Quang Tran ◽  
Isak Martin Simbolon ◽  
Chung-Hsien Kuo
2013 ◽  
Vol 659 ◽  
pp. 45-48
Author(s):  
Rui Wang ◽  
Zai Tang Wang

Comparing with some widely used road impedance functions, this paper choose BPR model as base model of improvement, and determine the parameter of BPR model. We apply the improved model to vehicle navigation system in the path planning algorithm, and experiments proved that the model satisfies navigation path planning requirement and have universal performance.


2021 ◽  
Vol 2025 (1) ◽  
pp. 012090
Author(s):  
Liu Yang ◽  
Limin Yu ◽  
Sha Tao ◽  
Zhenghong Yang ◽  
Wanlin Gao ◽  
...  

Sensors ◽  
2018 ◽  
Vol 18 (8) ◽  
pp. 2585 ◽  
Author(s):  
Anh Le ◽  
Veerajagadheswar Prabakaran ◽  
Vinu Sivanantham ◽  
Rajesh Mohan

Advancing an efficient coverage path planning in robots set up for application such as cleaning, painting and mining are becoming more crucial. Such drive in the coverage path planning field proposes numerous techniques over the past few decades. However, the proposed approaches were only applied and tested with a fixed morphological robot in which the coverage performance was significantly degraded in a complex environment. To this end, an A-star based zigzag global planner for a novel self-reconfigurable Tetris inspired cleaning robot (hTetro) presented in this paper. Unlike the traditional A-star algorithm, the presented approach can generate waypoints in order to cover the narrow spaces while assuming appropriate morphology of the hTtero robot with the objective of maximizing the coverage area. We validated the efficiency of the proposed planning approach in the Robot Operation System (ROS) Based simulated environment and tested with the hTetro robot in real-time under the controlled scenarios. Our experiments demonstrate the efficiency of the proposed coverage path planning approach resulting in superior area coverage performance in all considered experimental scenarios.


Author(s):  
Gorka Azkune ◽  
Mikel Astiz ◽  
Urko Esnaola ◽  
Unai Antero ◽  
Jose Vicente Sogorb ◽  
...  

Author(s):  
Takahiro SASAKI ◽  
Guillemo ENRIQUEZ ◽  
Takanobu MIWA ◽  
Shuji HASHIMOTO

2020 ◽  
Author(s):  
Qile He ◽  
Yu Sun

Many robot applications depend on solving the Complete Coverage Path Problem (CCPP). Specifically, robot vacuum cleaners have seen increased use in recent years, and some models offer room mapping capability using sensors such as LiDAR. With the addition of room mapping, applied robotic cleaning has begun to transition from random walk and heuristic path planning into an environment-aware approach. In this paper, a novel solution for pathfinding and navigation of indoor robot cleaners is proposed. The proposed solution plans a path from a priori cellular decomposition of the work environment. The planned path achieves complete coverage on the map and reduces duplicate coverage. The solution is implemented inside the ROS framework, and is validated with Gazebo simulation. Metrics to evaluate the performance of the proposed algorithm seek to evaluate the efficiency by speed, duplicate coverage and distance travelled.


Sign in / Sign up

Export Citation Format

Share Document