Stochastic Functional Gradient for Motion Planning in Continuous Occupancy Maps
Gilad Francis, Lionel Ott, Fabio Ramos

TL;DR
This paper introduces a stochastic functional gradient method for motion planning in continuous occupancy maps, enabling safe, efficient paths without fixed resolution constraints, and demonstrating improved convergence and performance.
Contribution
It presents a novel stochastic gradient optimization approach for trajectory planning using Gaussian processes in continuous occupancy maps, enhancing flexibility and convergence.
Findings
Outperforms existing methods in simulation and real data
Ensures convergence to the optimal path
Enables fast occupancy gradient computation
Abstract
Safe path planning is a crucial component in autonomous robotics. The many approaches to find a collision free path can be categorically divided into trajectory optimisers and sampling-based methods. When planning using occupancy maps, the sampling-based approach is the prevalent method. The main drawback of such techniques is that the reasoning about the expected cost of a plan is limited to the search heuristic used by each method. We introduce a novel planning method based on trajectory optimisation to plan safe and efficient paths in continuous occupancy maps. We extend the expressiveness of the state-of-the-art functional gradient optimisation methods by devising a stochastic gradient update rule to optimise a path represented as a Gaussian process. This approach avoids the need to commit to a specific resolution of the path representation, whether spatial or parametric. We utilise…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms · Autonomous Vehicle Technology and Safety · Robotics and Sensor-Based Localization
