中文
相关论文

相关论文: S-RRT*-based Obstacle Avoidance Autonomous Motion …

200 篇论文

We present Kinodynamic RRT*, an incremental sampling-based approach for asymptotically optimal motion planning for robots with linear differential constraints. Our approach extends RRT*, which was introduced for holonomic robots (Karaman et…

机器人学 · 计算机科学 2012-05-24 Dustin J. Webb , Jur van den Berg

Many exciting robotic applications require multiple robots with many degrees of freedom, such as manipulators, to coordinate their motion in a shared workspace. Discovering high-quality paths in such scenarios can be achieved, in principle,…

机器人学 · 计算机科学 2019-03-05 Rahul Shome , Kiril Solovey , Andrew Dobson , Dan Halperin , Kostas E. Bekris

Rapidly-exploring random trees (RRTs) have been widely adopted for robot motion planning due to their robustness and theoretical guarantees. However, existing RRT-based planners require explicit goal configurations specified as numerical…

机器人学 · 计算机科学 2026-04-21 Sebin Lee , Jumin Lee , Taeyeon Kim , Younju Na , Woobin Im , Sung-Eui Yoon

Coordinated multi-robot motion planning at intersections is key for safe mobility in roads, factories and warehouses. The rapidly exploring random tree (RRT) algorithms are popular in multi-robot motion planning. However, generating the…

机器人学 · 计算机科学 2024-12-03 Victor Parque

Robots have become increasingly prevalent in dynamic and crowded environments such as airports and shopping malls. In these scenarios, the critical challenges for robot navigation are reliability and timely arrival at predetermined…

机器人学 · 计算机科学 2023-09-21 Zhirui Sun , Boshu Lei , Peijia Xie , Fugang Liu , Junjie Gao , Ying Zhang , Jiankun Wang

This work aims to leverage instructional video to solve complex multi-step task-and-motion planning tasks in robotics. Towards this goal, we propose an extension of the well-established Rapidly-Exploring Random Tree (RRT) planner, which…

Rapidly exploring random trees (RRTs) have proven effective in quickly finding feasible solutions to complex motion planning problems. RRT* is an extension of the RRT algorithm that provides probabilistic asymptotic optimality guarantees…

机器人学 · 计算机科学 2023-02-24 James Swedeen , Greg Droge , Randall Christensen

A cuspidal robot can move from one inverse kinematics (IK) solution to another without crossing a singularity. Multiple industrial robots are cuspidal. They tend to have a beautiful mechanical design, but they pose path planning challenges.…

机器人学 · 计算机科学 2025-05-01 Alexander J. Elias , John T. Wen

Socially-aware robotic navigation is essential in environments where humans and robots coexist, ensuring both safety and comfort. However, most existing approaches have been primarily developed for mobile robots, leaving a significant gap…

机器人学 · 计算机科学 2025-06-18 Caio C. G. Ribeiro , Leonardo R. D. Paes , Douglas G. Macharet

Trajectory generation in confined environment is crucial for wide adoption of intelligent robot manipulators. In this paper, we propose a novel motion planning approach for redundant robot arms that uses a hybrid optimization framework to…

机器人学 · 计算机科学 2023-04-20 Yifan Sun , Weiye Zhao , Changliu Liu

Sampling-based motion planners such as Rapidly-exploring Random Tree* (RRT*) and its informed variant IRRT* are widely used for optimal path planning in complex environments. However, these methods often suffer from slow convergence and…

机器人学 · 计算机科学 2025-05-29 Hyejeong Ryu

Control Barrier Functions (CBF) are widely used to enforce the safety-critical constraints on nonlinear systems. Recently, these functions are being incorporated into a path planning framework to design safety-critical path planners.…

机器人学 · 计算机科学 2021-10-25 Aniketh Manjunath , Quan Nguyen

Rapidly-exploring Random Tree star (RRT*) has recently gained immense popularity in the motion planning community as it provides a probabilistically complete and asymptotically optimal solution without requiring the complete information of…

机器人学 · 计算机科学 2018-07-24 Zaid Tahir , Ahmed H. Qureshi , Yasar Ayaz , Raheel Nawaz

During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs) have been shown to work well in practice and to possess theoretical guarantees such as probabilistic…

机器人学 · 计算机科学 2010-05-05 Sertac Karaman , Emilio Frazzoli

We present an approach that generates kinodynamically feasible paths for robots using Rapidly-exploring Random Tree (RRT). We leverage motion primitives as a way to capture the dynamics of the robot and use these motion primitives to build…

机器人学 · 计算机科学 2022-10-31 Abhishek Paudel

Rapidly-exploring random tree (RRT) has been applied for autonomous parking due to quickly solving high-dimensional motion planning and easily reflecting constraints. However, planning time increases by the low probability of extending…

机器人学 · 计算机科学 2022-01-20 Minsoo Kim , Joonwoo Ahn , Jaeheung Park

Efficient navigation through uneven terrain remains a challenging endeavor for autonomous robots. We propose a new geometric-based uneven terrain mapless navigation framework combining a Sparse Gaussian Process (SGP) local map with a…

机器人学 · 计算机科学 2024-03-29 Abe Leininger , Mahmoud Ali , Hassan Jardali , Lantao Liu

Path planning is a classic problem for autonomous robots. To ensure safe and efficient point-to-point navigation an appropriate algorithm should be chosen keeping the robot's dimensions and its classification in mind. Autonomous robots use…

机器人学 · 计算机科学 2023-05-01 Alka Choudhary

The article develops an impact-resilient aerial robot (s-ARQ) equipped with a compliant arm to sense contacts and reduce collision impact and featuring a real-time contact force estimator and a non-linear motion controller to handle…

机器人学 · 计算机科学 2023-05-25 Zhichao Liu , Zhouyu Lu , Ali-akbar Agha-mohammadi , Konstantinos Karydis

Robust motion planning entails computing a global motion plan that is safe under all possible uncertainty realizations, be it in the system dynamics, the robot's initial position, or with respect to external disturbances. Current approaches…

机器人学 · 计算机科学 2022-11-02 Albert Wu , Thomas Lew , Kiril Solovey , Edward Schmerling , Marco Pavone