Motion planning in tori

Let X be a subcomplex of the standard CW-decomposition of the n-dimensional torus. We exhibit an explicit optimal motion planning algorithm for X. This construction is used to calculate the topological complexity of complements of general position arrangements and Eilenberg-Mac Lane spaces associated to right-angled Artin groups.Comment: Results extended to arbitrary subcomplexes of tori. Results on products of even spheres adde

An Extensible Benchmarking Infrastructure for Motion Planning Algorithms

Sampling-based planning algorithms are the most common probabilistically complete algorithms and are widely used on many robot platforms. Within this class of algorithms, many variants have been proposed over the last 20 years, yet there is still no characterization of which algorithms are well-suited for which classes of problems. This has motivated us to develop a benchmarking infrastructure for motion planning algorithms. It consists of three main components. First, we have created an extensive benchmarking software framework that is included with the Open Motion Planning Library (OMPL), a C++ library that contains implementations of many sampling-based algorithms. Second, we have defined extensible formats for storing benchmark results. The formats are fairly straightforward so that other planning libraries could easily produce compatible output. Finally, we have created an interactive, versatile visualization tool for compact presentation of collected benchmark data. The tool and underlying database facilitate the analysis of performance across benchmark problems and planners.Comment: Submitted to IEEE Robotics & Automation Magazine (Special Issue on Replicable and Measurable Robotics Research), 201

Cross-Entropy Randomized Motion Planning

Abstract—This paper is concerned with motion planning for nonlinear robotic systems operating in constrained environments. Motivated by recent developments in sampling-based motion planning and Monte Carlo optimization we propose a general randomized path planning method based on sampling in the space of trajectories. The idea is to construct a probability distribution over the set of feasible paths and to perform the search for an optimal trajectory through importance sampling. At the core of the approach lies the cross-entropy method for estimation of rare-event probabilities. The algorithm recursively approximates the optimal sampling distribution which guides the set of sampled trajectories towards regions of progressively lower cost until converging to a delta distribution at the optimum. Our main goal is to provide a framework for consistent adaptive sampling correlating the spatial structure of trajectories and their computed costs. The approach is illustrated with two simple examples–a point mass vehicle and the Dubins car, and is then applied to a simulated helicopter flying optimally in a 3-D terrain

3D Dynamic Motion Planning for Robot-Assisted Cannula Flexible Needle Insertion into Soft Tissue

In robot-assisted needle-based medical procedures, insertion motion planning is a crucial aspect. 3D dynamic motion planning for a cannula flexible needle is challenging with regard to the nonholonomic motion of the needle tip, the presence of anatomic obstacles or sensitive organs in the needle path, as well as uncertainties due to the dynamic environment caused by the movements and deformations of the organs. The kinematics of the cannula flexible needle is calculated in this paper. Based on a rapid and robust static motion planning algorithm, referred to as greedy heuristic and reachability-guided rapidly-exploring random trees, a 3D dynamic motion planner is developed by using replanning. Aiming at the large detour problem, the convergence problem and the accuracy problem that replanning encounters, three novel strategies are proposed and integrated into the conventional replanning algorithm. Comparisons are made between algorithms with and without the strategies to verify their validity. Simulations showed that the proposed algorithm can overcome the above-noted problems to realize real-time replanning in a 3D dynamic environment, which is appropriate for intraoperative planning. © 2016 Author

Optimal Motion of an Articulated Body in a Perfect Fluid

An articulated body can propel and steer itself in a perfect fluid by changing its shape only. Our strategy for motion planning for the submerged body is based on finding the optimal shape changes that produce a desired net locomotion; that is, motion planning is formulated as a nonlinear optimization problem