Bendable Cuboid Robot Path Planning with Collision Avoidance using Generalized L_p Norms

12/16/2017
by   Nak-seung P. Hyun, et al.
0

Optimal path planning problems for rigid and deformable (bendable) cuboid robots are considered by providing an analytic safety constraint using generalized L_p norms. For regular cuboid robots, level sets of weighted L_p norms generate implicit approximations of their surfaces. For bendable cuboid robots a weighted L_p norm in polar coordinates implicitly approximates the surface boundary through a specified level set. Obstacle volumes, in the environment to navigate within, are presumed to be approximately described as sub-level sets of weighted L_p norms. Using these approximate surface models, the optimal safe path planning problem is reformulated as a two stage optimization problem, where the safety constraint depends on a point on the robot which is closest to the obstacle in the obstacle's distance metric. A set of equality and inequality constraints are derived to replace the closest point problem, which is then defines additional analytic constraints on the original path planning problem. Combining all the analytic constraints with logical AND operations leads to a general optimal safe path planning problem. Numerically solving the problem involve conversion to a nonlinear programing problem. Simulations for rigid and bendable cuboid robot verify the proposed method.

READ FULL TEXT

page 5

page 10

research
04/23/2023

Sampling-based Path Planning Algorithms: A Survey

Path planning is a classic problem for autonomous robots. To ensure safe...
research
04/06/2021

Admissible heuristics for obstacle clearance optimization objectives

Obstacle clearance in state space is an important optimization objective...
research
01/06/2021

Dynamic Prioritization for Conflict-Free Path Planning of Multi-Robot Systems

Planning collision-free paths for multi-robot systems (MRS) is a challen...
research
09/12/2022

Edge Coverage Path Planning for Robot Mowing

Thanks to the rapid evolvement of robotic technologies, robot mowing is ...
research
11/28/2022

Path Planning for Concentric Tube Robots: a Toolchain with Application to Stereotactic Neurosurgery

We present a toolchain for solving path planning problems for concentric...
research
02/01/2023

Safe Interval Path Planning With Kinodynamic Constraints

Safe Interval Path Planning (SIPP) is a powerful algorithm for solving s...

Please sign up or login with your details

Forgot password? Click here to reset