Motion planning

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

Waalbot II: Adhesion Recovery and Improved Performance of a Climbing Robot using Fibrillar Adhesives

Abstract: This paper presents the design and optimization of a wall-climbing robot along with the incorporation of autonomous adhesion recovery and a motion planning implementation. The result is Waalbot II, an untethered 85 g robot able to climb on smooth vertical surfaces with up to a 100 g payload (117% body mass) or, when unburdened, on planar surfaces of any orientation at speeds up to 5 cm/s. Bio-inspired climbing mechanisms, such as Waalbot II’s gecko-like fibrillar adhesives, passive peeling, and force sensing, improve the overall climbing capabilities compared with initial versions, resulting in the ability to climb on non-smooth surfaces as well as on inverted smooth surfaces. Robot length scale optimization reveals and quantifies trends in the theoretical factor of safety and payload carrying capabilities. Autonomous adhesion recovery behavior provides additional climbing robustness without additional mechanical complexity to mitigate degradation and contamination. An implementation of a motion planner, designed to take into account Waalbot II’s kinematic constraints, results in the ability to navigate to a goal in complex three-dimensional environments while properly planning plane-to-plane transitions and avoiding obstacles. Experiments verified the improved climbing capabilities of Waalbot II as well as its novel semi-autonomous adhesion recovery behavior and motion planning.

A case study of mobile robot's energy consumption and conservation techniques

Abstract: Mobile robots are used in many applications, such as carpet cleaning, pickup and delivery, search and rescue, and entertainment. Energy limitation is one of the most important challenges for mobile robots. Most existing studies on mobile robots focus on motion planning to reduce motion power. However, motion is not the only power consumer. In this paper, we present a case study of a mobile robot called Pioneer 3DX. We analyze the energy consumers. We build power models for motion, sonar sensing and control based on experimental results. The results show that motion consume less than 50% power on average. Therefore, it is important to consider the other components in energy-efficient designs. We introduce two energy-conservation techniques: dynamic power management and real-time scheduling. We provide several examples showing how these techniques can be applied to robots. These techniques together with motion planning provide greater opportunities to achieve better energy efficiency for mobile robots. Although our study is based on a specific robot, the approach can be applied to other types of robots

A robot path planning framework that learns from experience

Abstract: We propose a framework, called Lightning, for planning paths in high-dimensional spaces that is able to learn from experience, with the aim of reducing computation time. This framework is intended for manipulation tasks that arise in applications ranging from domestic assistance to robot-assisted surgery. Our framework consists of two main modules, which run in parallel: a planning-from-scratch module, and a module that retrieves and repairs paths stored in a path library. After a path is generated for a new query, a library manager decides whether to store the path based on computation time and the generated path's similarity to the retrieved path. To retrieve an appropriate path from the library we use two heuristics that exploit two key aspects of the problem: (i) A correlation between the amount a path violates constraints and the amount of time needed to repair that path, and (ii) the implicit division of constraints into those that vary across environments in which the robot operates and those that do not. We evaluated an implementation of the framework on several tasks for the PR2 mobile manipulator and a minimally-invasive surgery robot in simulation. We found that the retrieve-and-repair module produced paths faster than planning-from-scratch in over 90% of test cases for the PR2 and in 58% of test cases for the minimally-invasive surgery robot.

A terrain-covering algorithm for an AUV

Abstract: An efficient, on-line terrain-covering algorithm is presented for a robot (AUV) moving in an unknown three-dimensional underwater environment. Such an algorithm is necessary for producing mosaicked images of the ocean floor. The basis of this three-dimensional motion planning algorithm is a new planar algorithm for nonsimply connected areas with boundaries of arbitrary shape. We show that this algorithm generalizes naturally to complex three-dimensional environments in which the terrain to be covered is projectively planar. This planar algorithm represents an improvement over previous algorithms because it results in a shorter path length for the robot and does not assume a polygonal environment. The path length of our algorithm is shown to be linear in the size of the area to be covered; the amount of memory required by the robot to implement the algorithm is linear in the size of the description of the boundary of the area. An example is provided that demonstrates the algorithm’s performance in a nonsimply connected, nonplanar environment.

Planning Paths for Package Delivery in Heterogeneous Multirobot Teams

Abstract: This paper addresses the task scheduling and path planning problem for a team of cooperating vehicles performing autonomous deliveries in urban environments. The cooperating team comprises two vehicles with complementary capabilities, a truck restricted to travel along a street network, and a quadrotor micro-aerial vehicle of capacity one that can be deployed from the truck to perform deliveries. The problem is formulated as an optimal path planning problem on a graph and the goal is to find the shortest cooperative route enabling the quadrotor to deliver items at all requested locations. The problem is shown to be NP-hard. A solution is then proposed using a novel reduction to the Generalized Traveling Salesman Problem, for which well-established heuristic solvers exist. The heterogeneous delivery problem contains as a special case the problem of scheduling deliveries from multiple static warehouses. We propose two additional algorithms, based on enumeration and a reduction to the traveling salesman problem, for this special case. Simulation results compare the performance of the presented algorithms and demonstrate examples of delivery route computations over real urban street maps.