English
Related papers

Related papers: Robust Sample-Based Output-Feedback Path Planning

200 papers

Continuum robots are compact and flexible, making them suitable for use in the industries and in medical surgeries. Rapidly-exploring random trees (RRT) are a highly efficient path planning method, and its variant, S-RRT, can generate…

Robotics · Computer Science 2024-10-01 Yulin Li , Tetsuro Miyazaki , Yoshiki Yamamoto , Kenji Kawashima

Despite the performance advantages of modern sampling-based motion planners, solving high dimensional planning problems in near real-time remains a challenge. Applications include hyper-redundant manipulators, snake-like and humanoid…

Robotics · Computer Science 2018-02-02 Marios P. Xanthidis , Joel M. Esposito , Ioannis Rekleitis , Jason M. O'Kane

Though great effort has been put into the study of path planning on urban roads and highways, few works have studied the driving strategy and trajectory planning in low-speed driving scenarios, e.g., driving on a university campus or…

Robotics · Computer Science 2019-04-05 Yuying Chen , Haoyang Ye , Ming Liu

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…

Robotics · Computer Science 2022-10-31 Abhishek Paudel

This work presents an efficient method to solve a class of continuous-time, continuous-space stochastic optimal control problems of robot motion in a cluttered environment. The method builds upon a path integral representation of the…

Systems and Control · Computer Science 2016-03-10 Jung-Su Ha , Han-Lim Choi

Robot motion planning involves computing a sequence of valid robot configurations that take the robot from its initial state to a goal state. Solving a motion planning problem optimally using analytical methods is proven to be PSPACE-Hard.…

Robotics · Computer Science 2021-07-26 Naman Shah , Abhyudaya Srinet , Siddharth Srivastava

In this paper, we present a novel RRT*-based strategy for generating kinodynamically feasible paths that satisfy temporal logic specifications. Our approach integrates a robustness metric for Linear Temporal Logics (LTL) with the system's…

Systems and Control · Electrical Eng. & Systems 2024-11-12 Saksham Gautam , Ratnangshu Das , Pushpak Jagtap

Path planning plays an important role in autonomous robot systems. Effective understanding of the surrounding environment and efficient generation of optimal collision-free path are both critical parts for solving path planning problem.…

Robotics · Computer Science 2020-12-08 Nachuan Ma , Jiankun Wang , Max Q. -H. Meng

Robots often need to solve path planning problems where essential and discrete aspects of the environment are partially observable. This introduces a multi-modality, where the robot must be able to observe and infer the state of its…

Robotics · Computer Science 2022-08-02 Camille Phiquepal , Andreas Orthey , Nicolas Viennot , Marc Toussaint

This paper investigates the use of a sampling-based approach, the RRT*, to reconfigure a 2D set of connected tiles in complex environments, where multiple obstacles might be present. Since the target application is automated building of…

Robotics · Computer Science 2022-10-27 Javier Garcia , Michael Yannuzzi , Peter Kramer , Christian Rieck , Aaron T. Becker

Autonomous exploration is a new technology in the field of robotics that has found widespread application due to its objective to help robots independently localize, scan maps, and navigate any terrain without human control. Up to present,…

We propose an approach to synthesize linear feedback controllers for linear systems in polygonal environments. Our method focuses on designing a robust controller that can account for uncertainty in measurements. Its inputs are provided by…

Systems and Control · Electrical Eng. & Systems 2023-10-13 Mehdi Kermanshah , Calin Belta , Roberto Tron

In this paper, we propose a sampling-based planning and optimal control method of nonlinear systems under non-differentiable constraints. Motivated by developing scalable planning algorithms, we consider the optimal motion plan to be a…

Systems and Control · Computer Science 2016-12-19 Jie Fu

Neighborhood finders and nearest neighbor queries are fundamental parts of sampling based motion planning algorithms. Using different distance metrics or otherwise changing the definition of a neighborhood produces different algorithms with…

Robotics · Computer Science 2025-06-17 Stav Ashur , Nancy M. Amato , Sariel Har-Peled

This paper addresses the challenging problem of robust path-following for fixed-wing unmanned aerial vehicles (UAVs) in complex environments with bounded external disturbances and non-smooth predefined paths. Due to the unique aerodynamic…

Systems and Control · Electrical Eng. & Systems 2025-07-10 Zimao Sheng , Hong'an Yang , Shuxiang Yang , Zirui Yu

This paper presents a method for constrained motion planning from vision, which enables a robot to move its end-effector over an observed surface, given start and destination points. The robot has no prior knowledge of the surface shape,…

Robotics · Computer Science 2020-06-23 T. Pardi , V. Ortenzi , C. Fairbairn , T. Pipe , A. M. Ghalamzan E. , R. Stolkin

Real-time path planning in constrained environments remains a fundamental challenge for autonomous systems. Traditional classical planners, while effective under perfect perception assumptions, are often sensitive to real-world perception…

Robotics · Computer Science 2026-02-02 Feng Tao , Luca Paparusso , Chenyi Gu , Robin Koehler , Chenxu Wu , Xinyu Huang , Christian Juette , David Paz , Ren Liu

This paper proposes a solution to the problem of smooth path planning for mobile robots in dynamic and unknown environments. A novel concept of Time-Warped Grid is introduced to predict the pose of obstacles in the environment and avoid…

Robotics · Computer Science 2019-03-19 Siavash Farzan , Guilherme N. DeSouza

Aerial robots are increasingly being utilized for environmental monitoring and exploration. However, a key challenge is efficiently planning paths to maximize the information value of acquired data as an initially unknown environment is…

Robotics · Computer Science 2022-03-04 Julius Rückin , Liren Jin , Marija Popović

Online planning in Markov Decision Processes (MDPs) enables agents to make sequential decisions by simulating future trajectories from the current state, making it well-suited for large-scale or dynamic environments. Sample-based methods…

Artificial Intelligence · Computer Science 2025-09-22 Tamir Shazman , Idan Lev-Yehudi , Ron Benchetit , Vadim Indelman
‹ Prev 1 8 9 10 Next ›