English
Related papers

Related papers: L4KDE: Learning for KinoDynamic Tree Expansion

200 papers

Rapidly Exploring Random Tree (RRT) algorithms, notably used for nonholonomic vehicle navigation in complex environments, are often not thoroughly evaluated for their specific challenges. This paper presents a first such comparison study of…

Robotics · Computer Science 2025-01-14 Trym Tengesdal , Tom Arne Pedersen , Tor Arne Johansen

This paper presents Latent Sampling-based Motion Planning (L-SBMP), a methodology towards computing motion plans for complex robotic systems by learning a plannable latent representation. Recent works in control of robotic systems have…

Robotics · Computer Science 2018-11-07 Brian Ichter , Marco Pavone

In this paper, we aim to improve the robustness of dynamic quadrupedal locomotion through two aspects: 1) fast model predictive foothold planning, and 2) applying LQR to projected inverse dynamic control for robust motion tracking. In our…

Bi-directional search is a widely used strategy to increase the success and convergence rates of sampling-based motion planning algorithms. Yet, few results are available that merge both bi-directional search and asymptotic optimality into…

Robotics · Computer Science 2016-01-05 Joseph A. Starek , Javier V. Gomez , Edward Schmerling , Lucas Janson , Luis Moreno , Marco Pavone

We address the problem of visually guided rearrangement planning with many movable objects, i.e., finding a sequence of actions to move a set of objects from an initial arrangement to a desired one, while relying on visual inputs coming…

Bidirectional motion planning often reduces planning time compared to its unidirectional counterparts. It requires connecting the forward and reverse search trees to form a continuous path. However, this process could fail and restart the…

Robotics · Computer Science 2025-08-28 Liding Zhang , Yao Ling , Zhenshan Bing , Fan Wu , Sami Haddadin , Alois Knoll

Online decision tree learning algorithms typically examine all features of a new data point to update model parameters. We propose a novel alternative, Reinforcement Learning- based Decision Trees (RLDT), that uses Reinforcement Learning…

Machine Learning · Computer Science 2015-07-27 Abhinav Garlapati , Aditi Raghunathan , Vaishnavh Nagarajan , Balaraman Ravindran

Efficient index structures for fast approximate nearest neighbor queries are required in many applications such as recommendation systems. In high-dimensional spaces, many conventional methods suffer from excessive usage of memory and slow…

Despite the latest prevailing success of deep neural networks (DNNs), several concerns have been raised against their usage, including the lack of intepretability the gap between DNNs and other well-established machine learning models, and…

Machine Learning · Computer Science 2021-01-01 Jianghao Shen , Sicheng Wang , Zhangyang Wang

Robots often have to operate in discrete partially observable worlds, where the states of world are only observable at runtime. To react to different world states, robots need contingencies. However, computing contingencies is costly and…

Robotics · Computer Science 2023-09-20 Janis Eric Freund , Camille Phiquepal , Andreas Orthey , Marc Toussaint

Sampling-based motion planning algorithms are widely used in robotics because they are very effective in high-dimensional spaces. However, the success rate and quality of the solutions are determined by an adequate selection of their…

Sampling efficiency in a highly constrained environment has long been a major challenge for sampling-based planners. In this work, we propose Rapidly-exploring Random disjointed-Trees* (RRdT*), an incremental optimal multi-query planner.…

Robotics · Computer Science 2019-02-28 Tin Lai , Fabio Ramos , Gilad Francis

Policy-gradient methods are widely used for learning control policies. They can be easily distributed to multiple workers and reach state-of-the-art results in many domains. Unfortunately, they exhibit large variance and subsequently suffer…

Machine Learning · Computer Science 2022-09-29 Gal Dalal , Assaf Hallak , Shie Mannor , Gal Chechik

Heuristic search is often used for motion planning and pathfinding problems, for finding the shortest path in a graph while also promising completeness and optimal efficiency. The drawback is it's space complexity, specifically storing all…

Artificial Intelligence · Computer Science 2024-06-10 Davor Bokan , Zlatan Ajanovic , Bakir Lacevic

This paper introduces Bidirectional Guidance Informed Trees (BIGIT*),~a new asymptotically optimal sampling-based motion planning algorithm. Capitalizing on the strengths of \emph{meet-in-the-middle} property in bidirectional heuristic…

Robotics · Computer Science 2024-12-10 Yi Wang , Bingxian Mu

Robot control problems are often structured with a policy function that maps state values into control values, but in many dynamic problems the observed state can have a difficult to characterize relationship with useful policy actions. In…

Machine Learning · Computer Science 2020-05-01 Max Pflueger , Gaurav S. Sukhatme

Although Large Language Models have advanced Automated Heuristic Design, treating algorithm evolution as a monolithic text generation task overlooks the coupling between discrete algorithmic structures and continuous numerical parameters.…

Artificial Intelligence · Computer Science 2026-02-10 Chentong Chen , Mengyuan Zhong , Ye Fan , Jialong Shi , Jianyong Sun

One of the key challenges in high speed off road navigation on ground vehicles is that the kinodynamics of the vehicle terrain interaction can differ dramatically depending on the terrain. Previous approaches to addressing this challenge…

Spatiotemporal prediction is important in solving natural problems and processing video frames, especially in weather forecasting and human action recognition. Recent advances attempt to incorporate prior physical knowledge into the deep…

Computer Vision and Pattern Recognition · Computer Science 2026-02-24 Xuanle Zhao , Yue Sun , Ziyi Wang , Bo Xu , Tielin Zhang

Motion planning has evolved from coping with simply geometric problems to physics-based ones that incorporate the kinodynamic and the physical constraints imposed by the robot and the physical world. Therefore, the criteria for evaluating…

Robotics · Computer Science 2017-10-03 Muhayyuddin , Aliakbar Akbari , Jan Rosell