Problem Of Motion Planning Research Articles

Dynamic event-triggered integrated task and motion planning for process-aware source seeking

The process-aware source seeking (PASS) problem in flow fields aims to find an informative trajectory to reach an unknown source location while taking the energy consumption in the flow fields into consideration. Taking advantage of the dynamic flow field partition technique, this paper formulates this problem as a task and motion planning (TAMP) problem and proposes a bi-level hierarchical planning framework to decouple the planning of inter-region transition and inner-region trajectory by introducing inter-region junctions. An integrated strategy is developed to enable efficient upper-level planning by investigating the optimal solution of the lower-level planner. In order to leverage the information acquisition and computational burden, a dynamic event-triggered mechanism is introduced to enable asynchronized estimation, region partitioning and re-plans. The proposed algorithm provides guaranteed convergence of the trajectory, and achieves automatic trade-offs of both exploration-exploitation and accuracy-efficiency. Simulations in a highly complicated and realistic ocean surface flow field validate the merits of the proposed algorithm, which demonstrates a significant reduction in computational burden without compromising planning optimality.

Balanced task allocation and motion planning of a multi-robot system under fuzzy time windows

PurposeA fleet of mobile robots has been effectively used in various application domains such as industrial plant inspection. This paper proposes a solution to the combined problem of task allocation and motion planning problem for a fleet of mobile robots which are requested to operate in an intelligent industry. More specifically, the robots are requested to serve a set of inspection points within given service time windows. In comparison with the conventional time windows, our problem considers fuzzy time windows to express the decision maker’s satisfaction for visiting an inspection point.Design/methodology/approachThe paper develops a unified approach to the combined problem of task allocation and motion planning for a fleet of mobile robots with three objectives: (a) minimizing the total travel cost considering all robots and tasks, (b) balancing fairly the workloads among robots and (c) maximizing the satisfaction grade of the decision maker for receiving the services. The optimization problem is solved by using a novel combination of a Genetic Algorithm with pareto solutions and fuzzy set theory.FindingsThe computational results illustrate the efficiency and effectiveness of the proposed approach. The experimental analysis leverages the potential for using fuzzy time windows to reflect real situations and respond to demanding situations.Originality/valueThis paper provides trade-off solutions to a realistic combinatorial multi-objective optimization problem considering concurrently the motion and path planning problem for a fleet of mobile robots with fuzzy time windows.

Anthropomorphic motion planning for multi-degree-of-freedom arms.

With the development of technology, the humanoid robot is no longer a concept, but a practical partner with the potential to assist people in industry, healthcare and other daily scenarios. The basis for the success of humanoid robots is not only their appearance, but more importantly their anthropomorphic behaviors, which is crucial for the human-robot interaction. Conventionally, robots are designed to follow meticulously calculated and planned trajectories, which typically rely on predefined algorithms and models, resulting in the inadaptability to unknown environments. Especially when faced with the increasing demand for personalized and customized services, predefined motion planning cannot be adapted in time to adapt to personal behavior. To solve this problem, anthropomorphic motion planning has become the focus of recent research with advances in biomechanics, neurophysiology, and exercise physiology which deepened the understanding of the body for generating and controlling movement. However, there is still no consensus on the criteria by which anthropomorphic motion is accurately generated and how to generate anthropomorphic motion. Although there are articles that provide an overview of anthropomorphic motion planning such as sampling-based, optimization-based, mimicry-based, and other methods, these methods differ only in the nature of the planning algorithms and have not yet been systematically discussed in terms of the basis for extracting upper limb motion characteristics. To better address the problem of anthropomorphic motion planning, the key milestones and most recent literature have been collated and summarized, and three crucial topics are proposed to achieve anthropomorphic motion, which are motion redundancy, motion variation, and motion coordination. The three characteristics are interrelated and interdependent, posing the challenge for anthropomorphic motion planning system. To provide some insights for the research on anthropomorphic motion planning, and improve the anthropomorphic motion ability, this article proposes a new taxonomy based on physiology, and a more complete system of anthropomorphic motion planning by providing a detailed overview of the existing methods and their contributions.

Learning to Execute Timed-Temporal-Logic Navigation Tasks under Input Constraints in Obstacle-Cluttered Environments

This study focuses on addressing the problem of motion planning within workspaces cluttered with obstacles while considering temporal and input constraints. These specifications can encapsulate intricate high-level objectives involving both temporal and spatial constraints. The existing literature lacks the ability to fulfill time specifications while simultaneously managing input-saturation constraints. The proposed approach introduces a hybrid three-component control algorithm designed to learn the safe execution of a high-level specification expressed as a timed temporal logic formula across predefined regions of interest in the workspace. The first component encompasses a motion controller enabling secure navigation within the minimum allowable time interval dictated by input constraints, facilitating the abstraction of the robot’s motion as a timed transition system between regions of interest. The second component utilizes formal verification and convex optimization techniques to derive an optimal high-level timed plan over the mentioned transition system, ensuring adherence to the agent’s specification. However, the necessary navigation times and associated costs among regions are initially unknown. Consequently, the algorithm’s third component iteratively adjusts the transition system and computes new plans as the agent navigates, acquiring updated information about required time intervals and associated navigation costs. The effectiveness of the proposed scheme is demonstrated through both simulation and experimental studies.

Constrained Motion Planning and Multi-Agent Path Finding on directed graphs

We discuss C-MP and C-MAPF, generalizations of the classical Motion Planning (MP) and Multi-Agent Path Finding (MAPF) problems on a directed graph G. Namely, we enforce an upper bound on the number of agents that occupy each member of a family of vertex subsets. For instance, this constraint allows maintaining a safety distance between agents. We prove that finding a feasible solution of C-MP and C-MAPF is NP-hard. Also, we propose a method to convert these problems to standard MP and MAPF by strengthening the constraints. The method consists in finding a subset of vertices W and a reduced graph GW, such that a feasible solution of MP and MAPF on GW provides, in polynomial time, a feasible solution of C-MP and C-MAPF on G. However, since the conversion into standard MP and MAPF is obtained by strengthening constraints, feasible solutions of C-MP and C-MAPF on G may exist even if MP and MAPF on GW do not admit any feasible solution. We also study the problem of finding W of maximum cardinality. First, we show that such problem is strongly NP-hard. Then, we propose a heuristic approach for its solution.

Sequential control barrier functions for mobile robots with dynamic temporal logic specifications

We address a motion planning and control problem for mobile robots to satisfy rich, time-varying tasks expressed as Signal Temporal Logic (STL) specifications. The specifications may include tasks with nested temporal operators or time-conflicting requirements (e.g., achieving periodic tasks or tasks defined within the same time interval). Moreover, the tasks can be defined in locations changing with time (i.e., dynamic targets), and their future motions are not known a priori. This unpredictability requires an online control approach which motivates us to investigate the use of control barrier functions (CBFs). The proposed CBFs take into account the actuation limits of the robots and a feasible sequence of STL tasks. They define time-varying feasible sets of states the system must always stay inside. We show the feasible sequence generation process that even includes the decomposition of periodic tasks and alternative scenarios due to disjunction operators. The sequence is used to define CBFs, ensuring STL satisfaction. We also show some theoretical results on the correctness of the proposed method. We illustrate the benefits of the proposed method and analyze its performance via simulations and experiments with aerial robots.

Motion planning and control of planar serial chain articulating locomotion system

This paper addresses two important problems in motion planning and control of serial chain planar articulating locomotion systems moving on a flat surface. Locomotion systems generally use closed curve cyclic gaits to perform maneuvers in the environment. The geometric mechanics tools are used to identify the cyclic gaits. Firstly, a motion control approach is presented using a single cyclic gait parametrized with variable gait parameters. The parameterized gait is used to drive the system along a continuous trajectory with varying curvature. On the other hand, the proposed approach presents how the gait parameters can be controlled to smoothly track a continuous trajectory. Secondly, this paper presents a joint coordination approach to generalize the height function based approach to design cyclic gaits for the system having joint space with more than two degrees of freedom. Using joint coordination approach, cyclic gaits can be designed for different motion behaviors such as longitudinal motion, sideways motion and rotation in place. The joint coordination approach also helps generalizing the proposed motion control approach to planar serial chain articulating robots with any even number of joints.

Real-Time On-the-Fly Motion Planning for Urban Air Mobility via Updating Tree Data of Sampling-Based Algorithms Using Neural Network Inference

In this study, we consider the problem of motion planning for urban air mobility applications to generate a minimal snap trajectory and trajectory that cost minimal time to reach a goal location in the presence of dynamic geo-fences and uncertainties in the urban airspace. We have developed two separate approaches for this problem because designing an algorithm individually for each objective yields better performance. The first approach that we propose is a decoupled method that includes designing a policy network based on a recurrent neural network for a reinforcement learning algorithm, and then combining an online trajectory generation algorithm to obtain the minimal snap trajectory for the vehicle. Additionally, in the second approach, we propose a coupled method using a generative adversarial imitation learning algorithm for training a recurrent-neural-network-based policy network and generating the time-optimized trajectory. The simulation results show that our approaches have a short computation time when compared to other algorithms with similar performance while guaranteeing sufficient exploration of the environment. In urban air mobility operations, our approaches are able to provide real-time on-the-fly motion re-planning for vehicles, and the re-planned trajectories maintain continuity for the executed trajectory. To the best of our knowledge, we propose one of the first approaches enabling one to perform an on-the-fly update of the final landing position and to optimize the path and trajectory in real-time while keeping explorations in the environment.

Dynamic Game Theoretic Electric Vehicle Decision Making

<div>Real-world driving in diverse traffic must cope with dynamic environments including a multitude of agents with uncertain behaviors. This poses a challenging motion planning and decision-making problem, as suitable algorithms should manage to obtain optimal solutions considering nearby vehicles. The state-of-the-art way of environment and action generalization is built on mathematical modeling and probabilistic programming of idealistic incidents. In this article we present dynamic anytime decision making, a decision-making algorithm that takes advantage of natural evolutionary and developmental processes to make decisions for an autonomous vehicle navigating in traffic. The methodology to achieve multidimensional judgment under unforeseen circumstances is to enable stochastic Bayesian game theory when modeling interactive properties and scenario estimation. In particular, we employ a dual-layer optimization strategy that substantially enhances the capability to extract mutual influence into decision matrix that organically synthesize decision rules according to encountered situations. Furthermore, our decision-making algorithm incorporates incremental capability that computes modified control variable due to unexpected vehicle behavior or intention. This results in improved performance gain where dynamic conditions receive reasoning with more effectiveness. We produce swift policy correction by leveraging previous game mechanism, where cooperative characteristics of both the controlled vehicle and other agents are integrated without computation overload. Aiming to reach utmost accurate decision, our reward function is reinforced with weight-tuning function to deduce optimal hyper parameters in a wider spectrum of vehicle scenarios. Through coupled decision tree optimization and incremental trajectory control, economical commands are computed with enhanced precision under complex traffic pattern. To this end, our system provides a robust framework in terms of handling dynamic vehicle interactive control, as decision is computed by synergy between progressive interface and external rationalization. We demonstrate the algorithm performing preeminent passing maneuvers and merging in a number of different simulated scenarios.</div>

Research of the Possibilities of Using a Rapidly Exploring Random Tree Algorithm in Solving Problems of Movement Planning of Autonomous Robots

The article is devoted to the analysis of features and evaluation of the prospects for using the RRT method in the problem of motion planning for autonomous robots. It is noted that the expansion of the areas of application of modern robotics is inextricably linked with an increase in the level of functionality and improvement of the designs of the created samples, for which the placement of a manipulator on a mobile platform becomes a typical layout. Based on a review of the literature and generalization of experimental data, it is shown that the use of the RRT method and its modifications opens up the fundamental possibility of developing a universal motion planner for mobile and manipulative robots, including systems with a manipulator on a mobile platform, as well as systems with a redundant or reconfigurable structure. Based on the results of the analysis, it was found that the effectiveness of the RRT method is largely determined by the declared parameter of the growth factor. A decentralized variant of the counter-growth RRT method is proposed, which makes it possible to plan the movements of autonomous mobile robots in the process of their mutual approach and subsequent docking. The fundamental possibility of automatic docking of autonomous robots in an environment with obstacles is confirmed by the results of a full-scale experiment.

Features and perspectives of application of the rapidly exploring random tree method for motion planning of autonomous robotic manipulators

Objectives. The work analyzes features of one of the most promising approaches to solve the problems for motion planning of autonomous robotic manipulators of various types and purposes using the rapidly exploring random tree (RRT) method. The development of modern robotics is shown to be inextricably linked with the improvement of the designs of the created samples, for which the placement of a manipulator on platform becomes a typical layout option. Prospects for using the RRT method as a constructive basis for creating a universal motion planner are evaluated for mobile and robotic manipulators, including autonomous robotic systems with a manipulator on a moving platform.Methods. The object of the research is the RRT method and its well-known modifications RRT* and RRT-Connect. The effectiveness of applying such methods for solving problems associated with planning the motions of robotic manipulators of various types was evaluated using computer and natural simulation methods.Results. Based on a review of the literature and the results of the research, the wide possibilities of the RRT method can be used for solving motion planning problems not only for mobile and robotic manipulators, but also for robotic systems on whose transport platform an onboard manipulator has been installed (including those having a redundant or reconfigurable structure). The effectiveness of the applied application of the RRT method is confirmed by examples of modeling a mobile platform with an onboard manipulator and the results of full-scale experiments with a prototype of the ARAKS reconfigurable mechatronic-modular robotic manipulators (RTU MIREA, Russia). It can be experimentally demonstrated and theoretically substantiated that the final dimension of the exploring tree, and hence the time of its construction up to reaching a given target state, is largely determined by the value of the growth factor.Conclusions. The generalization of the results obtained opens up real prospects for using the RRT method as a constructive basis not only for creating universal means for motion planning mobile robotic systems with an onboard manipulator, but also for solving the problems of automating the docking of autonomous mobile platforms.

Tensor train for global optimization problems in robotics

The convergence of many numerical optimization techniques is highly dependent on the initial guess given to the solver. To address this issue, we propose a novel approach that utilizes tensor methods to initialize existing optimization solvers near global optima. Our method does not require access to a database of good solutions. We first transform the cost function, which depends on both task parameters and optimization variables, into a probability density function. Unlike existing approaches, the joint probability distribution of the task parameters and optimization variables is approximated using the Tensor Train model, which enables efficient conditioning and sampling. We treat the task parameters as random variables, and for a given task, we generate samples for decision variables from the conditional distribution to initialize the optimization solver. Our method can produce multiple solutions (when they exist) faster than existing methods. We first evaluate the approach on benchmark functions for numerical optimization that are hard to solve using gradient-based optimization solvers with a naive initialization. The results show that the proposed method can generate samples close to global optima and from multiple modes. We then demonstrate the generality and relevance of our framework to robotics by applying it to inverse kinematics with obstacles and motion planning problems with a 7-DoF manipulator.

PRM Path Smoothening by Circular Arc Fillet Method for Mobile Robot Navigation

The problem of motion planning and navigation for mobile robots in complex environments has been a central issue in robotics. Navigating these environments requires sophisticated algorithms that handle obstacles and provide smooth, efficient paths. The Probabilistic Roadmap (PRM) method is a widespread technique in robotics for constructing paths for mobile robot navigation. In this study, we propose a novel path-smoothing method using arc fillets for path planning, building on PRM's foundation in the presence of obstacles. Our method operates in two primary stages to improve path efficiency and quality. The first stage generates the shortest path between the initial and goal states in an obstacle-rich environment using PRM, constructing a straight-line, collision-free route. The second stage smooths corners caused by nodes with arc fillets, ensuring smooth turns and minimizing abrupt changes in direction, resulting in more natural and efficient robot motion. We conducted simulations and tests using various PRM features to evaluate the proposed method. The results indicate that the built route offers a smooth turning motion and quicker, more compact movement while evading obstacles. This study contributes to mobile robot navigation by offering a practical approach to improving pathway quality in challenging environments.

METHODS OF TASK AND MOTION PLANNING FOR ROBOTS: APPLICATIONS AND LIMITATIONS

Robots are increasingly required to perform more complex tasks, which in turn demand advanced planning algorithms. Task and Motion Planning (TAMP) methods, studied for decades, have made significant progress but still face various challenges. This document provides an overview of TAMP's development, encompassing problem-solving, simulation environments, methods, and remaining limitations. It particularly compares different simulation environments and methods used in various tasks, offering a practical guide and overview for beginners. Task planning is typically seen as planning in discrete spaces, while motion planning deals with continuous spaces. Significant progress has been made in integrating discrete and continuous planning methods to address TAMP problems. A recent survey has focused on TAMP integration, summarizing various methods for solving multimodal motion planning and TAMP problems. It introduces general concepts but primarily focuses on methods that operate in fully observable environments, which are far from real-world applications. Additionally, it demonstrates TAMP problem-solving in a theoretical manner that may not be user-friendly for beginners looking to apply these methods in practice. Therefore, this article aims to provide a practical and broader overview to readers, facilitating an easy entry into the field of TAMP for solving various tasks. Keywords: task and motion planning, simulation environment, learning methods, TAMP.

Task-oriented safety field for robot control in human-robot collaborative assembly based on residual learning

With the development of smart manufacturing, human-robot collaboration (HRC) is seen as the future of manufacturing. In a manufacturing environment with HRC, safety has been raising significant attention since the conventional separation of workspaces between robots and humans is removed. In this paper, a dynamic safety field is constructed that takes into account the collaborative assembly task requirements and the motions of both humans and robots. This safety field guides robot actions, ensuring that the robot carries out the required tasks while maintaining a safe distance from human workers. Based on the task requirements and safety considerations between humans and robots, a robot motion planning and control problem is formulated. To solve this problem, a hybrid RRL control scheme is proposed where a residual reinforcement learning (RRL) method is developed to combine the safety field-based control method with a deep reinforcement learning (DRL) method. Numerical studies are conducted to evaluate the performance of the proposed, which is compared with a pure deep Q-network (DQN) based method and a rapidly exploring random tree (RRT) method. The simulation results show that the proposed method can effectively optimize robot trajectories and outperforms the DQN-based and the RRT method in terms of computational efficiency.

Edge-Assisted V2X Motion Planning and Power Control Under Channel Uncertainty

Edge-assisted vehicle-to-everything (V2X) motion planning is an emerging paradigm to achieve safe and efficient autonomous driving, since it leverages the global position information shared among multiple vehicles. However, due to the imperfect channel state information (CSI), the position information of vehicles may become outdated and inaccurate. Conventional methods ignoring the communication delays could severely jeopardize driving safety. To fill this gap, this paper proposes a robust V2X motion planning policy that adapts between competitive driving under a low communication delay and conservative driving under a high communication delay, and guarantees small communication delays at key waypoints via power control. This is achieved by integrating the vehicle mobility and communication delay models and solving a joint design of motion planning and power control problem via the block coordinate descent framework. Simulation results show that the proposed driving policy achieves the smallest collision ratio compared with other benchmark policies.

Radar-based path planning of autonomous surface vehicle with static and dynamic obstacles in a Frenet Frame

AbstractNavigation safety at sea is vital for each autonomous surface vehicle (ASV), which involves the problem of motion planning in dynamic environments and their robust tracking through feedback control. We present a practical path-planning method that generates smooth trajectories for a marine vehicle traveling in an unknown environment, where obstacles are detected in real time by millimetre wave (mmWave) radar. Our approach introduces a polynomial curve to describe the lateral and longitudinal trajectories in the Frenet frame, known as the ‘motion primitives’, whose combination ensures that the planning area is properly covered. In addition, we can select a feasible, optimal and collision-free trajectory from such a set of motion primitives that is generated by considering the vehicle dynamics and comfort. The capabilities of proposed algorithm are demonstrated in the experiment with static and dynamic obstacles.

Autonomous Data Collection With Dynamic Goals and Communication Constraints for Marine Vehicles

In marine robotics, data-collection operations often require an autonomous underwater vehicle (AUV) to collaborate with an unmanned surface vehicle (USV). The mission for the AUV is to reach many goal locations, avoid obstacles and unsafe areas, and maintain communication with the USV. The goals, however, are not known a priori, but are dynamically discovered by the USV as it moves along a predefined path. The USV communicates the discovered goals to the AUV along with rewards for reaching each goal to incentivize the AUV to increase the sum of the rewards when obstacles, time, and communication constraints make it impossible to reach all the goals. We develop a framework comprised of an execution module and a multi-layered planner to enable the AUV to avoid collisions, maintain communication with the USV, and increase the sum of the rewards by reaching many of the discovered goals. The execution module enables the AUV to follow the planned motions, invoking the planner when new goals are discovered. To facilitate navigation, the planner constructs a 3D roadmap that captures the connectivity of the environment by sampling and connecting waypoints in the free space. The high-level planning layer is based on informed discrete search to find roadmap paths that satisfy the communication constraints and increase the sum of the goal rewards. The low-level layer uses sampling-based motion planning to expand a tree of feasible motions along these roadmap paths. The layers interact to update the planned motions as new goals are discovered. Experiments using 3D environments and an increasing number of goals demonstrate the efficiency of the approach to solve dynamic multi-goal motion-planning problems with communication constraints. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Note to Practitioners</i> —This paper is motivated by the problem of at-sea data collection using unmanned vehicles where inter-vehicle communications constraints must be maintained. This is a challenging problem that has generally required significant human monitoring and intervention due to the communication constraints and planning challenges. In this paper, we leverage recent advances in underwater communications and focus on new problems that arise in the planning space, specifically, how we generate trajectories for an AUV that satisfies communication range constraints while still performing an underlying task. We show that it is possible to plan for an AUV in real-time while considering these constraints. This paper suggests that our approach can support these complex at-sea missions. Future research will focus on field deployments and introducing more uncertainty into the underlying sensor models during planning.

Multi-robot motion planning for unit discs with revolving areas

We study the problem of motion planning for a collection of n labeled unit disc robots in a polygonal environment. We assume that the robots have revolving areas around their start and final positions: that each start and each final is contained in a radius 2 disc lying in the free space, not necessarily concentric with the start or final position, which is free from other start or final positions. This assumption allows a weakly-monotone motion plan, in which robots move according to an ordering as follows: during the turn of a robot R in the ordering, it moves fully from its start to final position, while other robots do not leave their revolving areas. As R passes through a revolving area, a robot R′ that is inside this area may move within the revolving area to avoid a collision. Notwithstanding the existence of a motion plan, we show that minimizing the total traveled distance in this setting, specifically even when the motion plan is restricted to be weakly-monotone, is APX-hard, ruling out any polynomial-time (1+ε)-approximation algorithm.On the positive side, we present the first constant-factor approximation algorithm for computing a feasible weakly-monotone motion plan. The total distance traveled by the robots is within an O(1) factor of that of the optimal motion plan, which need not be weakly monotone. Our algorithm extends to an online setting in which the polygonal environment is fixed but the initial and final positions of robots are specified in an online manner. Finally, we observe that the overhead in the overall cost that we add while editing the paths to avoid robot-robot collision can vary significantly depending on the ordering we chose. Finding the best ordering in this respect is known to be NP-hard, and we provide a polynomial time O(log⁡nlog⁡log⁡n)-approximation algorithm for this problem.

Navigation of a compartmentalized robot system

After making progression in developing the fundamental problems related to single-robot control, many researchers swerved and diverged their focus to studying multi-robot coordination. This research aims to take the motion planning and control (MPC) problem of a multi-robot system into a new space by considering a compartmentalized robot. An efficient variant of globally rigid formation, in which multiple car-like units are adjoint and move in parallel without collisions. The motion is governed by one of the sub-units acting as a leader, while other units maintain the fixed distance amongst each other and the leader in a rigid formation. The minimum distance technique is an important input to facilitate collision avoidance, robot decision making, and robot navigation. In this study a novel method to analytically compute the minimum distance between the closest point on the line segments of rectangular protective region and the obstacle is presented. Utilizing the Lyapunov-based Control Scheme a set of autonomous controllers are designed. Computer simulations of the proposed Lyapunov-based controllers for the compartmentalized robot are presented in interesting scenarios to show the efficacy of the unique set of controllers. In these simulations, the compartmentalized robot shows strict maintenance of a rigid formation with efficient collision and obstacle avoidance. The results open up research in the design and implementation of controllers by considering multiple compartmentalized robots into swarm models, splitting and re-joining units, and applying rotational leadership ideas.