Asymptotically optimal sampling-based motion planning methods
Motion planning is a fundamental problem in autonomous robotics that requires finding a
path to a specified goal that avoids obstacles and takes into account a robot's limitations and …
path to a specified goal that avoids obstacles and takes into account a robot's limitations and …
Bench-mr: A motion planning benchmark for wheeled mobile robots
Planning smooth and energy-efficient paths for wheeled mobile robots is a central task for
applications ranging from autonomous driving to service and intralogistic robotics. Over the …
applications ranging from autonomous driving to service and intralogistic robotics. Over the …
Perceptive model predictive control for continuous mobile manipulation
A mobile robot needs to be aware of its environment to interact with it safely. We propose a
receding horizon control scheme for mobile manipulators that tracks task space reference …
receding horizon control scheme for mobile manipulators that tracks task space reference …
Bimanual regras** for suture needles using reinforcement learning for rapid motion planning
Regras** a suture needle is an important yet time-consuming process in suturing. To
bring efficiency into regras**, prior work either designs a task-specific mechanism or …
bring efficiency into regras**, prior work either designs a task-specific mechanism or …
Graph-based robot optimal path planning with bio-inspired algorithms
Recently, bio-inspired algorithms have been increasingly explored for autonomous robot
path planning on grid-based maps. However, these approaches endure performance …
path planning on grid-based maps. However, these approaches endure performance …
Nfomp: Neural field for optimal motion planner of differential drive robots with nonholonomic constraints
Optimal motion planning is one of the most critical problems in mobile robotics. On the one
hand, classical sampling-based methods propose asymptotically optimal solutions to this …
hand, classical sampling-based methods propose asymptotically optimal solutions to this …
Fast kinodynamic planning on the constraint manifold with deep neural networks
Motion planning is a mature area of research in robotics with many well-established
methods based on optimization or sampling the state space, suitable for solving kinematic …
methods based on optimization or sampling the state space, suitable for solving kinematic …
Informed anytime Bi-directional Fast Marching Tree for optimal motion planning in complex cluttered environments
K Wang, J Xu, K Song, Y Yan, Y Peng - Expert Systems with Applications, 2023 - Elsevier
Practical applications favor anytime asymptotically-optimal algorithms that find a feasible
solution and improve it toward the optimal solution within limited time. This paper proposed …
solution and improve it toward the optimal solution within limited time. This paper proposed …
[HTML][HTML] Toward asymptotically-optimal inspection planning via efficient near-optimal graph search
Inspection planning, the task of planning motions that allow a robot to inspect a set of points
of interest, has applications in domains such as industrial, field, and medical robotics …
of interest, has applications in domains such as industrial, field, and medical robotics …
ST-FMT*: A fast optimal global motion planning for mobile robot
Z Wu, Y Chen, J Liang, B He… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
This article introduces a secure tunnel fast marching tree motion planning algorithm (ST-
FMT*) to provide a secure and optimal path quickly for a mobile robot. The proposed ST …
FMT*) to provide a secure and optimal path quickly for a mobile robot. The proposed ST …