Minimum cost path planning for autonomous robot in the random traversability space

1988 ◽  
Author(s):  
P. Graglia ◽  
A. Meystel
Keyword(s):  
Path Planning ◽  
Minimum Cost ◽  
Autonomous Robot

scholarly journals Safe Path Planning Algorithms for Mobile Robots Based on Probabilistic Foam

Sensors ◽  
2021 ◽  
Vol 21 (12) ◽  
pp. 4156
Author(s):  
Luís B. P. Nascimento ◽  
Dennis Barrios-Aranibar ◽  
Vitor G. Santos ◽  
Diego S. Pereira ◽  
William C. Ribeiro ◽  
...  
Keyword(s):  
Path Planning ◽  
Mobile Robots ◽  
Configuration Space ◽  
Autonomous Robot ◽  
Breadth First Search ◽  
Propagation Process ◽  
Robot Systems ◽  
And Performance ◽  
Safe Path ◽  
High Clearance

The planning of safe paths is an important issue for autonomous robot systems. The Probabilistic Foam method (PFM) is a planner that guarantees safe paths bounded by a sequence of structures called bubbles that provides safe regions. This method performs the planning by covering the free configuration space with bubbles, an approach analogous to a breadth-first search. To improve the propagation process and keep the safety, we present three algorithms based on Probabilistic Foam: Goal-biased Probabilistic Foam (GBPF), Radius-biased Probabilistic Foam (RBPF), and Heuristic-guided Probabilistic Foam (HPF); the last two are proposed in this work. The variant GBPF is fast, HPF finds short paths, and RBPF finds high-clearance paths. Some simulations were performed using four different maps to analyze the behavior and performance of the methods. Besides, the safety was analyzed considering the new propagation strategies.

scholarly journals Environment Mapping Robot Using Supersonic Sensor

1999 ◽  
Vol 11 (6) ◽  
pp. 468-472
Author(s):  
Masafumi Uchida ◽  
◽  
Tanaka Hisaya ◽  
Hideto Ide ◽  
Keyword(s):  
Computer Simulation ◽  
Path Planning ◽  
Autonomous Robot ◽  
Working Environment ◽  
Occupancy Grid ◽  
Environment Map ◽  
Planning Algorithm ◽  
And Performance ◽  
Path Planning Algorithm ◽  
Range Sensors

We studied an automapping algorithm for an autonomous robot having ultrasonic range sensors. A robot with a working environment map operates smoothly. The robot consisted of an automapping algorithm using ultrasonic range sensors and a path planning algorithm. Ultrasonic range sensors are basic, inexpensive, and compact. We proposed an automapping algorithm introducing a parameter, valid length, for a robot with ultrasonic range sensors. The map was based on an occupancy grid. Computer simulation confirmed the effectiveness of introducing valid length in mapping by an autonomous robot. We discuss proposed distinctions and performance.

A method for path planning of autonomous robot using A∗ algorithm

2013 ◽  
Author(s):  
Hao Xu ◽  
Xiangrong Xu ◽  
Yan Li ◽  
Xiaosheng Zhu ◽  
Chongzhi Song ◽  
...  
Keyword(s):  
Path Planning ◽  
Autonomous Robot

scholarly journals A Novel Cooperative Path Planning for Multi-robot Persistent Coverage with Obstacles and Coverage Period Constraints

Sensors ◽  
2019 ◽  
Vol 19 (9) ◽  
pp. 1994 ◽  
Author(s):  
Guibin Sun ◽  
Rui Zhou ◽  
Bin Di ◽  
Zhuoning Dong ◽  
Yingxun Wang
Keyword(s):  
Path Planning ◽  
Numerical Simulations ◽  
Obstacle Avoidance ◽  
Travelling Salesman Problem ◽  
Region Of Interest ◽  
Minimum Cost ◽  
Closed Path ◽  
Combinatorial Approach ◽  
Travelling Salesman ◽  
Multi Robot

In this paper, a multi-robot persistent coverage of the region of interest is considered, where persistent coverage and cooperative coverage are addressed simultaneously. Previous works have mainly concentrated on the paths that allow for repeated coverage, but ignored the coverage period requirements of each sub-region. In contrast, this paper presents a combinatorial approach for path planning, which aims to cover mission domains with different task periods while guaranteeing both obstacle avoidance and minimizing the number of robots used. The algorithm first deploys the sensors in the region to satisfy coverage requirements with minimum cost. Then it solves the travelling salesman problem to obtain the frame of the closed path. Finally, the approach partitions the closed path into the fewest segments under the coverage period constraints, and it generates the closed route for each robot on the basis of portioned segments of the closed path. Therefore, each robot can circumnavigate one closed route to cover the different task areas completely and persistently. The numerical simulations show that the proposed approach is feasible to implement the cooperative coverage in consideration of obstacles and coverage period constraints, and the number of robots used is also minimized.

Sign in / Sign up

Export Citation Format

Share Document