## Hybrid controllers for path planning: A temporal logic approach (2005)

### Cached

### Download Links

Venue: | in IEEE Conference on Decision and Control |

Citations: | 28 - 13 self |

### BibTeX

@INPROCEEDINGS{Fainekos05hybridcontrollers,

author = {Georgios E. Fainekos and Hadas Kress-gazit},

title = {Hybrid controllers for path planning: A temporal logic approach},

booktitle = {in IEEE Conference on Decision and Control},

year = {2005},

pages = {4885--4890}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract — Robot motion planning algorithms have focused on low-level reachability goals taking into account robot kinematics, or on high level task planning while ignoring low-level dynamics. In this paper, we present an integrated approach to the design of closed–loop hybrid controllers that guarantee by construction that the resulting continuous robot trajectories satisfy sophisticated specifications expressed in the so–called Linear Temporal Logic. In addition, our framework ensures that the temporal logic specification is satisfied even in the presence of an adversary that may instantaneously reposition the robot within the environment a finite number of times. This is achieved by obtaining a Büchi automaton realization of the temporal logic specification, which supervises a finite family of continuous feedback controllers, ensuring consistency between the discrete plan and the continuous execution. I.

### Citations

621 | Planning Algorithms
- LaValle
- 2006
(Show Context)
Citation Context ...pan a wide variety of methods, from continuous (like potential or navigation functions [1]) to discrete (like Canny’s algorithm, Voronoi diagrams, cell decompositions and probabilistic road maps [1], =-=[2]-=-). Whereas these methods solve basic path planning problems, they do not address high level planning issues that arise when considering a number of goals or a particular ordering of them. In order to ... |

272 | Using temporal logics to express search control knowledge for planning
- Bacchus, Kabanza
- 2000
(Show Context)
Citation Context ...istence of an adversary with the properties described in Section II. Even though there exist general planners based on symbolic methods [4] and on the manipulation of the temporal formulas explicitly =-=[21]-=-, they are not well suited for the specific structure of our problem. The typical planners generate plans that are either a sequence of actions (if there do not exist any observable predicates) or a t... |

233 |
Principles of Robot Motion: Theory, Algorithms, and Implementations
- CHOSET, LYNCH, et al.
- 2005
(Show Context)
Citation Context ...al position I to the Goal position G while staying within region R”. The solutions to this well-studied problem span a wide variety of methods, from continuous (like potential or navigation functions =-=[1]-=-) to discrete (like Canny’s algorithm, Voronoi diagrams, cell decompositions and probabilistic road maps [1], [2]). Whereas these methods solve basic path planning problems, they do not address high l... |

198 | Discrete abstractions of hybrid systems
- Alur, Henzinger, et al.
- 2000
(Show Context)
Citation Context ...atisfy the specification, we choose the shortest one. In order to ensure that the discrete plan is feasible at the continuous level, the decomposition must satisfy the so-called bisimulation property =-=[19]-=-. The feedback controllers that are presented in [17] and [18] satisfy this property. Bisimulations allow us to prove that if the abstract, discrete robot model satisfies the LTL formula, then the con... |

92 | Robust hybrid control for autonomous vehicle motion planning. Department of aeronautics and astronautics
- Frazzoli
- 2001
(Show Context)
Citation Context ... specifications in LTL. Related approaches to motion planning using hybrid or symbolic methods include the design of controllers that satisfy temporal logic specifications [11], the maneuver automata =-=[12]-=-, the motion description language [13], the control and computation language [14] and the control quanta [15]. In this paper, we extend our previous work by designing closed-loop hybrid controllers th... |

85 |
Planning as model checking
- Giunchiglia, Traverso
- 1999
(Show Context)
Citation Context ...eger linear programming [3]. Even though the aforementioned methods can handle partial ordering of goals, they cannot deal with temporally extended goals. For such specifications, planning techniques =-=[4]-=-, [5] that are based on model checking [6] seem more natural choices. Using temporally extended goals, one would sacrifice some of the efficiency of the standard planning methods for expressiveness in... |

62 |
The Spin Model Checker: Primer and Reference
- Holzmann
- 2003
(Show Context)
Citation Context ...CC) in the graph. If at least one SCC that contains a final state (s ∈ F ) is reachable from some state in the set of initialsstates S0, then the language L(B) of B is non-empty (for more details see =-=[20]-=-). V. OPEN-LOOP HYBRID CONTROLLER The design of the open-loop hybrid controller consists of two parts. First, the creation of a trajectory on the discrete abstraction of the robot workspace (presented... |

60 |
Aircraft trajectory planning with collision avoidance using mixed integer linear programming
- Richards, How
- 2002
(Show Context)
Citation Context ...hem. In order to manage such constraints, one should either employ an existing high level planning method [2] or attack the problem using optimization techniques like mixed integer linear programming =-=[3]-=-. Even though the aforementioned methods can handle partial ordering of goals, they cannot deal with temporally extended goals. For such specifications, planning techniques [4], [5] that are based on ... |

38 | Automata-theoretic approach to planning for temporally extended goals
- Giacomo, Vardi
- 2000
(Show Context)
Citation Context ...linear programming [3]. Even though the aforementioned methods can handle partial ordering of goals, they cannot deal with temporally extended goals. For such specifications, planning techniques [4], =-=[5]-=- that are based on model checking [6] seem more natural choices. Using temporally extended goals, one would sacrifice some of the efficiency of the standard planning methods for expressiveness in the ... |

34 | Discrete abstractions for robot motion planning and control in polygonal environments
- Belta, Isler, et al.
- 2004
(Show Context)
Citation Context ...s. A variety of partitions are applicable [16], but we focus on triangular decompositions and general cellular partitions as these have been successfully applied to the basic path planning problem in =-=[17]-=- and [18] respectively. The partition results in a natural discrete abstraction of the robot motion which is used then for planning with automata theoretic methods [5]. In particular, we use the autom... |

28 | Temporal logic motion planning for mobile robots
- Fainekos, Kress-Gazit, et al.
(Show Context)
Citation Context ...PAAL model checking toolbox for timed automata has been applied to the multi-robot motion planning using CTL formulas, but without taking into account the dynamics of the robots. In our previous work =-=[10]-=-, we have presented a framework for the design of an open–loop hybrid controller that generates continuous trajectories that satisfy temporal specifications in LTL. Related approaches to motion planni... |

17 | Automatic synthesis of multiagent motion tasks based on LTL specifications
- Loizou, Kyriakopoulos
- 2004
(Show Context)
Citation Context ...adelphia, PA 19104, USA. E-mail: {fainekos,hadaskg,pappasg}@grasp.cis.upenn.edu The applicability of temporal logics in robotics was advocated as far back as [7]. In more recent works, the authors in =-=[8]-=- design controllers that satisfy LTL formulas by composing controllers using navigation functions. In [9], the UPPAAL model checking toolbox for timed automata has been applied to the multi-robot moti... |

17 |
Motion planning through symbols and lattices
- Pancanti, Pallottino, et al.
- 2004
(Show Context)
Citation Context ...sign of controllers that satisfy temporal logic specifications [11], the maneuver automata [12], the motion description language [13], the control and computation language [14] and the control quanta =-=[15]-=-. In this paper, we extend our previous work by designing closed-loop hybrid controllers that guarantee the generation of continuous robot trajectories that satisfy temporal specifications in an adver... |

15 |
On the complexity of the motion description language MDLe
- Hristu-Varsakelis, Egerstedt, et al.
- 2003
(Show Context)
Citation Context ...ches to motion planning using hybrid or symbolic methods include the design of controllers that satisfy temporal logic specifications [11], the maneuver automata [12], the motion description language =-=[13]-=-, the control and computation language [14] and the control quanta [15]. In this paper, we extend our previous work by designing closed-loop hybrid controllers that guarantee the generation of continu... |

14 |
A language for modeling and programming cooperative control systems
- Klavins
- 2004
(Show Context)
Citation Context ...bolic methods include the design of controllers that satisfy temporal logic specifications [11], the maneuver automata [12], the motion description language [13], the control and computation language =-=[14]-=- and the control quanta [15]. In this paper, we extend our previous work by designing closed-loop hybrid controllers that guarantee the generation of continuous robot trajectories that satisfy tempora... |

13 | Discrete event models + temporal logic = supervisory controller: Automatic synthesis of locomotion controllers
- Antoniotti, Mishra
- 1995
(Show Context)
Citation Context ...boratory, University of Pennsylvania, Philadelphia, PA 19104, USA. E-mail: {fainekos,hadaskg,pappasg}@grasp.cis.upenn.edu The applicability of temporal logics in robotics was advocated as far back as =-=[7]-=-. In more recent works, the authors in [8] design controllers that satisfy LTL formulas by composing controllers using navigation functions. In [9], the UPPAAL model checking toolbox for timed automat... |

8 | Multi-robot planning: A timed automata approach
- Quottrup, Bak, et al.
(Show Context)
Citation Context ...oral logics in robotics was advocated as far back as [7]. In more recent works, the authors in [8] design controllers that satisfy LTL formulas by composing controllers using navigation functions. In =-=[9]-=-, the UPPAAL model checking toolbox for timed automata has been applied to the multi-robot motion planning using CTL formulas, but without taking into account the dynamics of the robots. In our previo... |

5 | From discrete specifications to hybrid control - Tabuada, Pappas - 2003 |

5 |
Construction and automated deployment of local potential functions for global robot control and navigation
- Conner, Rizzi, et al.
- 2003
(Show Context)
Citation Context ...ety of partitions are applicable [16], but we focus on triangular decompositions and general cellular partitions as these have been successfully applied to the basic path planning problem in [17] and =-=[18]-=- respectively. The partition results in a natural discrete abstraction of the robot motion which is used then for planning with automata theoretic methods [5]. In particular, we use the automaton, whi... |