Online search of unknown terrains using a dynamical system-based path planning approach

03/22/2021
by   Karan Sridharan, et al.
0

Surveillance and exploration of large environments is a tedious task. In spaces with limited environmental cues, random-like search appears to be an effective approach as it allows the robot to perform online coverage of environments using a simple design. One way to generate random-like scanning is to use nonlinear dynamical systems to impart chaos into the robot's controller. This will result in generation of unpredictable but at the same time deterministic trajectories, allowing the designer to control the system and achieve a high scanning coverage. However, the unpredictability comes at the cost of increased coverage time and lack of scalability, both of which have been ignored by the state-of-the-art chaotic path planners. This study introduces a new scalable technique that helps a robot to steer away from the obstacles and cover the entire space in a short period of time. The technique involves coupling and manipulating two chaotic systems to minimize the coverage time and enable scanning of unknown environments with different properties online. Using this technique resulted in 49 performance compared to the state-of-the-art planners. While ensuring unpredictability in the paths, the overall performance of the chaotic planner remained comparable to optimal systems.

READ FULL TEXT

page 12

page 15

page 17

research
05/03/2023

Autonomous search of real-life environments combining dynamical system-based path planning and unsupervised learning

In recent years, advancements have been made towards the goal of using c...
research
06/27/2019

A Constant-Factor Approximation Algorithm for Online Coverage Path Planning with Energy Constraint

In this paper, we study the problem of coverage planning by a mobile rob...
research
06/29/2023

End-to-end Reinforcement Learning for Online Coverage Path Planning in Unknown Environments

Coverage path planning is the problem of finding the shortest path that ...
research
07/22/2019

Revisiting Boustrophedon Coverage Path Planning as a Generalized Traveling Salesman Problem

In this paper, we present a path planner for low-altitude terrain covera...
research
03/03/2023

Graph-based Simultaneous Coverage and Exploration Planning for Fast Multi-robot Search

In large unknown environments, search operations can be much more time-e...
research
12/23/2020

Autonomous Outdoor Scanning via Online Topological and Geometric Path Optimization

Autonomous 3D acquisition of outdoor environments poses special challeng...
research
10/19/2020

CT-CPP: 3D Coverage Path Planning for Unknown Terrain Reconstruction using Coverage Trees

This letter addresses the 3D coverage path planning (CPP) problem for te...

Please sign up or login with your details

Forgot password? Click here to reset