Proofs of the Technical Results Justifying an Algorithm for Collision Avoidance in Dynamic Environments with Moving and Deforming Obstacles
classification
🧮 math.OC
keywords
obstaclesalgorithmdynamicenvironmentsneedproofstechnicalavoidance
read the original abstract
This text presents the proofs of the technical facts underlying theoretical justification of the convergence and performance of the novel algorithm for reactive navigation of differential drive wheeled robots in dynamic uncertain environments. The algorithm restricts neither the natures nor the motions of the obstacles, they need not be rigid but conversely may deform. It does not consume data about the velocities, shapes, sizes, or orientations of the obstacles, and does not need a map of the environment or recognition of individual obstacles. The only information about the scene is the current distance to the nearest obstacle.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.