EECI 2020: Minimum Violation Planning: Difference between revisions

From Murray Wiki
Jump to navigationJump to search
Line 5: Line 5:


== Further Reading ==
== Further Reading ==
* <p>[https://dl.acm.org/doi/pdf/10.1145/2461328.2461330 Least-violating Control Strategy Synthesis with Safety Rules] J. Tumova, G.C Hall, S.  Karaman, E.  Frazzoli and D. Rus, HSCC 2013. Detail on minimum violation planning for finite state systems.
* <p>[https://dl.acm.org/doi/pdf/10.1145/2461328.2461330 Least-violating Control Strategy Synthesis with Safety Rules] J. Tumova, G.C Hall, S.  Karaman, E.  Frazzoli and D. Rus, HSCC 2013. Detail on minimum violation planning for finite state systems.</p>
* <p>[https://arxiv.org/pdf/1305.1102.pdf Incremental Sampling-based Algorithm for Minimum-violation Motion Planning] L.I.R. Castro, P. Chaudhari, J. Tumova, S. Karaman, E. Frazzoli, D. Rus, CDC 2013. Incremental version of minimum violation planning.
* <p>[https://arxiv.org/pdf/1305.1102.pdf Incremental Sampling-based Algorithm for Minimum-violation Motion Planning] L.I.R. Castro, P. Chaudhari, J. Tumova, S. Karaman, E. Frazzoli, D. Rus, CDC 2013. Incremental version of minimum violation planning.</p>
* <p>[https://link.springer.com/content/pdf/10.1007%2F3-540-46002-0_30.pdf Temporal debugging for concurrent systems] E.L. Gunter and D. Peled, TACAS 2002. Detail on finite LTL and translation to finite automaton</p>
* <p>[https://link.springer.com/content/pdf/10.1007%2F3-540-46002-0_30.pdf Temporal debugging for concurrent systems] E.L. Gunter and D. Peled, TACAS 2002. Detail on finite LTL and translation to finite automaton</p>

Revision as of 18:57, 28 February 2020

Lecture Materials

  • Lecture slides

Further Reading