EECI 2020: Minimum Violation Planning: Difference between revisions
| (3 intermediate revisions by 2 users not shown) | |||
| Line 3: | Line 3: | ||
== Lecture Materials == | == Lecture Materials == | ||
* [ | * [http://www.cds.caltech.edu/~murray/courses/eeci-sp2020//L8_mvp-12Mar2020.pdf Lecture slides] | ||
== Further Reading == | == Further Reading == | ||
| Line 9: | Line 9: | ||
* <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://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://www.sites.google.com/site/tichakorn/acc14.pdf?attredirects=0 Incremental Synthesis of Minimum-Violation Control Strategies for Robots Interacting with External Agents] P. Chaudhari, T. Wongpiromsarn and E. Frazzoli, ACC 2014. Multi-agent version of minimum violation planning.</p> | * <p>[https://www.sites.google.com/site/tichakorn/acc14.pdf?attredirects=0 Incremental Synthesis of Minimum-Violation Control Strategies for Robots Interacting with External Agents] P. Chaudhari, T. Wongpiromsarn and E. Frazzoli, ACC 2014. Multi-agent version of minimum violation planning.</p> | ||
* <p>[https://arxiv.org/pdf/1105.1186.pdf Sampling-based Algorithms for Optimal Motion Planning] S. Karaman and E. Frazzoli, IJRR 2011. Sampling-based algorithms. | * <p>[https://arxiv.org/pdf/1105.1186.pdf Sampling-based Algorithms for Optimal Motion Planning] S. Karaman and E. Frazzoli, IJRR 2011. Sampling-based algorithms.</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> | ||
Latest revision as of 05:12, 13 March 2020
| Prev: Computer Session: TuLiP | Course home | Next: Computer Session: MVP |
Lecture Materials
Further Reading
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.
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.
Incremental Synthesis of Minimum-Violation Control Strategies for Robots Interacting with External Agents P. Chaudhari, T. Wongpiromsarn and E. Frazzoli, ACC 2014. Multi-agent version of minimum violation planning.
Sampling-based Algorithms for Optimal Motion Planning S. Karaman and E. Frazzoli, IJRR 2011. Sampling-based algorithms.
Temporal debugging for concurrent systems E.L. Gunter and D. Peled, TACAS 2002. Detail on finite LTL and translation to finite automaton
