Motion planning for mobile manipulators—a systematic review
One of the fundamental fields of research is motion planning. Mobile manipulators present a
unique set of challenges for the planning algorithms, as they are usually kinematically …
unique set of challenges for the planning algorithms, as they are usually kinematically …
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 …
Behavior-1k: A benchmark for embodied ai with 1,000 everyday activities and realistic simulation
We present BEHAVIOR-1K, a comprehensive simulation benchmark for human-centered
robotics. BEHAVIOR-1K includes two components, guided and motivated by the results of an …
robotics. BEHAVIOR-1K includes two components, guided and motivated by the results of an …
UAV trajectory planning based on bi-directional APF-RRT* algorithm with goal-biased
J Fan, X Chen, X Liang - Expert systems with applications, 2023 - Elsevier
In recent decades, RRT* algorithm has attracted much attention because of its asymptotic
optimization. However, the RRT* algorithm still suffers from slow convergence rate and large …
optimization. However, the RRT* algorithm still suffers from slow convergence rate and large …
Behavior: Benchmark for everyday household activities in virtual, interactive, and ecological environments
We introduce BEHAVIOR, a benchmark for embodied AI with 100 activities in simulation,
spanning a range of everyday household chores such as cleaning, maintenance, and food …
spanning a range of everyday household chores such as cleaning, maintenance, and food …
Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic
Rapidly-exploring random trees (RRTs) are popular in motion planning because they find
solutions efficiently to single-query problems. Optimal RRTs (RRT* s) extend RRTs to the …
solutions efficiently to single-query problems. Optimal RRTs (RRT* s) extend RRTs to the …
Potentially guided bidirectionalized RRT* for fast optimal path planning in cluttered environments
Abstract Rapidly-exploring Random Tree star (RRT*) has recently gained immense
popularity in the motion planning community as it provides a probabilistically complete and …
popularity in the motion planning community as it provides a probabilistically complete and …
Intelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments
The sampling-based motion planning algorithm known as Rapidly-exploring Random Trees
(RRT) has gained the attention of many researchers due to their computational efficiency …
(RRT) has gained the attention of many researchers due to their computational efficiency …
UAV trajectory planning in cluttered environments based on PF-RRT* algorithm with goal-biased strategy
J Fan, X Chen, Y Wang, X Chen - Engineering Applications of Artificial …, 2022 - Elsevier
In recent decades, Rapidly-exploring Random Tree star (RRT*) with asymptotic optimality
has attracted much attention in path planning algorithm, but it suffers from slow …
has attracted much attention in path planning algorithm, but it suffers from slow …
RRT*-Connect: Faster, asymptotically optimal motion planning
We present an efficient asymptotically-optimal randomized motion planning algorithm
solving single-query path planning problems using a bidirectional search. The algorithm …
solving single-query path planning problems using a bidirectional search. The algorithm …