scispace - formally typeset
Search or ask a question
Topic

Motion planning

About: Motion planning is a research topic. Over the lifetime, 32846 publications have been published within this topic receiving 553548 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: The SENARIO project is develoing a sensor-aided intelligent navigation system that provides high-level navigational aid to users of powered wheelchairs and has succeeded in fully supporting semi-autonomous navigation.
Abstract: The SENARIO project is develoing a sensor-aided intelligent navigation system that provides high-level navigational aid to users of powered wheelchairs. The authors discuss new and improved technologies developed within SENARIO concerning task/path planning, sensing and positioning for indoor mobile robots as well as user interface issues. The autonomous mobile robot SENARIO, supports semi- or fully autonomous navigation. In semi-autonomous mode the system accepts typical motion commands through a voice-activated or standard joystick interface and supports robot motion with obstacle/collision avoidance features. Fully autonomous mode is a superset of semi-autonomous mode with the additional ability to execute autonomously high-level go-to-goal commands. At its current stage, the project has succeeded in fully supporting semi-autonomous navigation, while experiments on the fully autonomous mode are very encouraging.

194 citations

Journal ArticleDOI
TL;DR: In this article, the map is partitioned into subgraphs of known structure with entry and exit restrictions and planning then becomes a search in the much smaller space of subgraph configurations.
Abstract: Multi-robot path planning is dificult due to the combinatorial explosion of the search space with every new robot added Complete search of the combined state-space soon becomes intractable In this paper we present a novel form of abstraction that allows us to plan much more eficiently The key to this abstraction is the partitioning of the map into subgraphs of known structure with entry and exit restrictions which we can represent compactly Planning then becomes a search in the much smaller space of subgraph configurations Once an abstract plan is found, it can be quickly resolved into a correct (but possibly sub-optimal) concrete plan without the need for further search We prove that this technique is sound and complete and demonstrate its practical effiectiveness on a real map A contending solution, prioritised planning, is also evaluated and shown to have similar performance albeit at the cost of completeness The two approaches are not necessarily conflicting; we demonstrate how they can be combined into a single algorithm which out-performs either approach alone

193 citations

Proceedings ArticleDOI
01 Oct 2016
TL;DR: This paper presents a continuous-time trajectory optimization method for real-time collision avoidance on multirotor UAVs, and proposes a system where this motion planning method is used as a local replanner, that runs at a high rate to continuously recompute safe trajectories as the robot gains information about its environment.
Abstract: Multirotor unmanned aerial vehicles (UAVs) are rapidly gaining popularity for many applications. However, safe operation in partially unknown, unstructured environments remains an open question. In this paper, we present a continuous-time trajectory optimization method for real-time collision avoidance on multirotor UAVs. We then propose a system where this motion planning method is used as a local replanner, that runs at a high rate to continuously recompute safe trajectories as the robot gains information about its environment. We validate our approach by comparing against existing methods and demonstrate the complete system avoiding obstacles on a multirotor UAV platform.

193 citations

Journal ArticleDOI
TL;DR: A proof of heading convergence using feedback is complete, and a novel approach for heading convergence that does not require continuous feedback in the ideal case (no wind, stationary target), taking advantage of an analytical solution to the guidance field is proposed.
Abstract: In this paper, we present work on control of autonomous vehicle formations in the context of the coordinated stando tracking problem . The objective is to use a team of unmanned aircraft to fly a circular orbit around a moving target with prescribed inter-vehicle angular spacing using only local information. We use the recently introduced Lyapunov guidance vector field approach to achieve the desired circular trajectory. The contributions of this paper involve both single vehicle path planning and multiple vehicle coordination. For single vehicle path planning, we complete a proof of heading convergence using feedback, which has thus far not been fully addressed in the literature, and also oer a novel approach for heading convergence that does not require continuous feedback in the ideal case (no wind, stationary target), taking advantage of an analytical solution to the guidance field. Further, we use a variable airspeed controller to maintain the circular trajectory despite unknown wind and unknown constant velocity target motion. Adaptive estimates of the unknown wind and target motion are introduced to ensure stability to the circular trajectory. A novel feature of our results is rigorous satisfaction of vehicle specific kinematic constraints on heading rates and airspeed variations. For multiple vehicle coordination, we again use a variable airspeed controller to achieve the prescribed angular spacing. In an eort towards a unified framework for control of autonomous vehicle formations, we make a connection with some recent work that addresses information architecture in vehicle formations using graph theory. Specifically, we utilize two types of information architectures, symmetric and asymmetric, and implement decentralized control laws. The information architectures are scalable in the sense that the number of required communication/sensing links increases linearly with the number of vehicles. The control laws are decentralized in the sense that they use only local information.

193 citations

Journal ArticleDOI
TL;DR: A planner is presented that computes quasi-static motion of large legged robots that have many degrees of freedom by combining graph searching to generate a sequence of candidate footfalls with probabilistic sample-based planning to generate continuous motions that reach these footfalls.
Abstract: In this paper we study the quasi-static motion of large legged robots that have many degrees of freedom. While gaited walking may suffice on easy ground, rough and steep terrain requires unique sequences of footsteps and postural adjustments specifically adapted to the terrain's local geometric and physical properties. In this paper we present a planner that computes these motions by combining graph searching to generate a sequence of candidate footfalls with probabilistic sample-based planning to generate continuous motions that reach these footfalls. To improve motion quality, the probabilistic planner derives its sampling strategy from a small set of motion primitives that have been generated offline. The viability of this approach is demonstrated in simulation for the six-legged Lunar vehicle ATHLETE and the humanoid HRP-2 on several example terrains, including one that requires both hand and foot contacts and another that requires rappelling.

193 citations


Network Information
Related Topics (5)
Control theory
299.6K papers, 3.1M citations
90% related
Control system
129K papers, 1.5M citations
88% related
Robustness (computer science)
94.7K papers, 1.6M citations
87% related
Object detection
46.1K papers, 1.3M citations
86% related
Optimization problem
96.4K papers, 2.1M citations
83% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20231,512
20223,388
20212,138
20202,668
20192,648
20182,266