Algorithms for minimum-violation planning with formal specifications (original) (raw)
Related papers
Temporal-Logic-Based Reactive Mission and Motion Planning
IEEE Transactions on Robotics, 2000
This paper provides a framework to automatically generate a hybrid controller that guarantees that the robot can achieve its task when a robot model, a class of admissible environments, and a high-level task or behavior for the robot are provided. The desired task specifications, which are expressed in a fragment of linear temporal logic (LTL), can capture complex robot behaviors such as search and rescue, coverage, and collision avoidance. In addition, our framework explicitly captures sensor specifications that depend on the environment with which the robot is interacting, which results in a novel paradigm for sensor-based temporal-logicmotion planning. As one robot is part of the environment of another robot, our sensor-based framework very naturally captures multirobot specifications in a decentralized manner. Our computational approach is based on first creating discrete controllers satisfying specific LTL formulas. If feasible, the discrete controller is then used to guide the sensor-based composition of continuous controllers, which results in a hybrid controller satisfying the highlevel specification but only if the environment is admissible.
Temporal Logic Motion Planning for Mobile Robots
2006
In this paper, we consider the problem of robot motion planning in order to satisfy formulas expressible in temporal logics. Temporal logics naturally express traditional robot specifications such as reaching a goal or avoiding an obstacle, but also more sophisticated specifications such as sequencing, coverage, or temporal ordering of different tasks. In order to provide computational solutions to this problem, we first construct discrete abstractions of robot motion based on some environmental decomposition. We then generate discrete plans satisfying the temporal logic formula using powerful model checking tools, and finally translate the discrete plans to continuous trajectories using hybrid control. Critical to our approach is providing formal guarantees ensuring that if the discrete plan satisfies the temporal logic formula, then the continuous motion also satisfies the exact same formula.
Motion planning with complex goals
2011
Abstract This article describes approach for solving motion planning problems for mobile robots involving temporal goals. Traditional motion planning for mobile robotic systems involves the construction of a motion plan that takes the system from an initial state to a set of goal states while avoiding collisions with obstacles at all times. The motion plan is also required to respect the dynamics of the system that are typically described by a set of differential equations.
Motion planning with hybrid dynamics and temporal goals
2010
Abstract In this paper, we consider the problem of motion planning for mobile robots with nonlinear hybrid dynamics, and high-level temporal goals. We use a multi-layered synergistic framework that has been proposed recently for solving planning problems involving hybrid systems and high-level temporal goals. In that framework, a high-level planner employs a user-defined discrete abstraction of the hybrid system as well as exploration information to suggest high-level plans.
Proceedings of the AAAI Conference on Artificial Intelligence
The specification of complex motion goals through temporal logics is increasingly favored in robotics to narrow the gap between task and motion planning. A major limiting factor of such logics, however, is their Boolean satisfaction condition. To relax this limitation, we introduce a method for quantifying the satisfaction of co-safe linear temporal logic specifications, and propose a planner that uses this method to synthesize robot trajectories with the optimal satisfaction value. The method assigns costs to violations of specifications from user-defined proposition costs. These violation costs define a distance to satisfaction and can be computed algorithmically using a weighted automaton. The planner utilizes this automaton and an abstraction of the robotic system to construct a product graph that captures all possible robot trajectories and their distances to satisfaction. Then, a plan with the minimum distance to satisfaction is generated by employing this graph as the high-le...
Motion planning with temporal-logic specifications: Progress and challenges
AI Communications, 2015
Integrating task and motion planning is becoming increasingly important due to the recognition that a growing number of robotics applications in navigation, search-and-rescue missions, manipulation, and medicine involve reasoning with both discrete abstractions and continuous motions. The problem poses unique computational challenges: a vast hybrid discrete/continuous space must be searched while accounting for complex geometries, motion dynamics, collision avoidance, and temporal goals. This paper takes the position that continued progress relies on integrative approaches that bring together techniques from robotics and AI. In this context, the paper examines robot motion planning with temporal-logic specifications and discusses open challenges and directions for future research. The paper aims to promote a continuing dialog between robotics and AI communities.
Temporal logic motion planning for dynamic robots
Automatica, 2009
In this paper, we address the temporal logic motion planning problem for mobile robots that are modeled by second order dynamics. Temporal logic specifications can capture the usual control specifications such as reachability and invariance as well as more complex specifications like sequencing and obstacle avoidance. Our approach consists of three basic steps. First, we design a control law that enables the dynamic model to track a simpler kinematic model with a globally bounded error. Second, we built a robust temporal logic specification that takes into account the tracking errors of the first step. Finally, we solve the new robust temporal logic path planning problem for the kinematic model using automata theory and simple local vector fields. The resulting continuous time trajectory is provably guaranteed to satisfy the initial user specification.
Optimal temporal logic planning with cascading soft constraints
2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 2019
In this paper, we address the problem of temporal logic planning given both hard specifications of the robot's mission and soft preferences on the plans that achieve the mission. In particular, we consider a problem whose inputs are a transition system, a linear temporal logic (LTL) formula specifying the robot's mission, and an ordered sequence of formulas expressed in linear dynamic logic over finite traces (LDL f) specifying the user's preferences for how the mission should be completed. The planner's objective is to synthesize, on this transition system, an infinite trajectory that best fits the user's preferences over finite prefixes of that trajectory while nonetheless satisfying the overall objective. We describe an algorithm for this problem that constructs, from the inputs, a product automaton-which is, in fact, a special kind of stateweighted Büchi automaton-over which an optimal trajectory is synthesized. This synthesis problem is solved via reduction to the minimax path problem in vertex weighted graphs, which can be solved by variants of the standard algorithms for computing shortest paths in a graph or by algorithms for the all-pairs bottleneck paths problem on vertex-weighted graphs. We show the applicability of the approach via some case studies, for which we present results computed by an implementation.
Temporal Logic based Motion Planning in Unstructured Environments
In this paper we describe the problem of motion planning for mul- tiple goals in unstructured environments by using temporal logic for speci- cation of the goals. We solve the problem of mission planning for mobile robots, wherein the goal of the robot can be a complex mission speci cation rather than a classical "Go from A to B" problem. To achieve this problem we take a two dimensional map of the real environment and identify the re- gions of interest, navigable areas and non-navigable areas, which are tagged to make the nal map. We also assume that during the motion of the robot the current position is known and the environment is stationary. We describe the high level planing algorithm which gives a trajectory catering to the tem- poral logic based goal speci cation. We use optimal graph search to search for an optimal solution, while at each step checking for the validity of the temporal logic. Simulation results to various practical scenarios are provided making a robot act over high level speci cations while yielding optimal plans.
Efficient planning with state trajectory constraints
2005
This paper introduces a general planning approach with state trajectory constraints, a language extension that has recently been introduced to PDDL for running the Fifth International Planning Competition in 2006. In our approach PDDL inputs with state trajectory constraints are translated into ordinary (fully instantiated) PDDL. It exploits the automata-based interpretation of the constraints, and refers to planning via explicit-state model checking. We explain how trajectory constraints are translated into LTL and non-deterministic Büchi automata and how these automata are compiled back to ordinary PDDL predicates and actions. We provide promising initial experimental results with heuristic search planning.