A generalized Bellman-Ford Algorithm for Application in Symbolic Optimal Control

Symbolic controller synthesis is a fully-automated and correct-by-design synthesis scheme whose limitations are its immense memory and runtime requirements. A current trend to compensate for this downside is to develop techniques for parallel execution of the scheme both in mathematical foundation and in software implementation. In this paper we present a generalized Bellman-Ford algorithm to be used in the so-called symbolic optimal control, which is an extension of the aforementioned synthesis scheme. Compared to the widely used Dijkstra algorithm our algorithm has two advantages. It allows for cost functions taking arbitrary (e.g. negative) values and for parallel execution with the ability for trading processing speed for memory consumption. We motivate the usefulness of negative cost values on a scenario of aerial firefighting with unmanned aerial vehicles. In addition, this four-dimensional numerical example, which is rich in detail, demonstrates the great performance of our algorithm.

[1]  Gunther Reissig,et al.  Feedback Refinement Relations for the Synthesis of Symbolic Controllers , 2015, IEEE Transactions on Automatic Control.

[2]  J. Y. Yen.  An algorithm for finding shortest routes from all source nodes to a given destination in general networks , 1970 .

[3]  Paulo Tabuada,et al.  Verification and Control of Hybrid Systems , 2009 .

[4]  Joseph Sifakis,et al.  On the Synthesis of Discrete Controllers for Timed Systems (An Extended Abstract) , 1995, STACS.

[5]  Majid Zamani,et al.  SCOTS: A Tool for the Synthesis of Symbolic Controllers , 2016, HSCC.

[6]  Gunther Reissig,et al.  Symbolic Optimal Control , 2017, IEEE Transactions on Automatic Control.

[7]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[8]  Gunther Reissig,et al.  Memory efficient symbolic solution of quantitative reach-avoid problems , 2019, 2019 American Control Conference (ACC).

[9]  L. Grüne,et al.  Global Optimal Control of Perturbed Systems , 2007 .

[10]  Amir Pnueli,et al.  Synthesis of Reactive(1) designs , 2006, J. Comput. Syst. Sci..

[11]  Tomasz Kapela,et al.  A Lohner-type algorithm for control systems and ordinary differential inclusions , 2007, 0712.0910.

[12]  Antoine Girard,et al.  Controller synthesis for safety and reachability via approximate bisimulation , 2010, Autom..

[13]  Gunther Reissig,et al.  Strongly convex attainable sets and low complexity finite-state controllers , 2013, 2013 Australian Control Conference.

[14]  Giorgio Ausiello,et al.  Minimal Representation of Directed Hypergraphs , 1986, SIAM J. Comput..

[15]  T. Lindvall.  ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.

[16]  Olaf Stursberg,et al.  On-the-fly model abstraction for controller synthesis , 2012, 2012 American Control Conference (ACC).

[17]  David Eppstein,et al.  Randomized Speedup of the Bellman-Ford Algorithm , 2011, ANALCO.

[18]  L. R. Ford,et al.  NETWORK FLOW THEORY , 1956 .

[19]  Antoine Girard,et al.  Synthesis using approximately bisimilar abstractions: state-feedback controllers for safety specifications , 2010, HSCC '10.

[20]  Feng Lin,et al.  Design and implementation of an unmanned aerial vehicle for autonomous firefighting missions , 2016, 2016 12th IEEE International Conference on Control and Automation (ICCA).

[21]  Gunther Reissig,et al.  Approximate value iteration for a class of deterministic optimal control problems with infinite state and input alphabets , 2016, 2016 IEEE 55th Conference on Decision and Control (CDC).

[22]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[23]  John Lygeros,et al.  A Stochastic Hybrid Model for Air Traffic Control Simulation , 2004, HSCC.

[24]  Majid Zamani,et al.  pFaces: an acceleration ecosystem for symbolic control , 2019, HSCC.

[25]  Mohammed El-Abd,et al.  Semi-autonomous indoor firefighting UAV , 2017, 2017 18th International Conference on Advanced Robotics (ICAR).

[26]  Gunther Reissig,et al.  Computing Abstractions of Nonlinear Systems , 2009, IEEE Transactions on Automatic Control.

[27]  Gunther Reissig,et al.  Abstraction-based solution of optimal stopping problems under uncertainty , 2013, 52nd IEEE Conference on Decision and Control.

[28]  Rupak Majumdar,et al.  Lazy Abstraction-Based Control for Safety Specifications , 2018, 2018 IEEE Conference on Decision and Control (CDC).

[29]  Michael Garland,et al.  Work-Efficient Parallel GPU Methods for Single-Source Shortest Paths , 2014, 2014 IEEE 28th International Parallel and Distributed Processing Symposium.

[30]  Nicola Bombieri,et al.  An Efficient Implementation of the Bellman-Ford Algorithm for Kepler GPU Architectures , 2016, IEEE Transactions on Parallel and Distributed Systems.

[31]  K. Harikumar,et al.  Multi-UAV Oxyrrhis Marina-Inspired Search and Dynamic Formation Control for Forest Firefighting , 2019, IEEE Transactions on Automation Science and Engineering.