📣 Try out the NEW Gateway to Research and let us know what you think.

We're looking for users to test the new service during August and September and share their feedback. Express your interest by completing this short form.

Computing Time-Optimal Clearing Strategies for Pursuit-Evasion Problems with Linear Programming

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/978-3-319-22416-9_26

Publication URI: http://dx.doi.org/10.1007/978-3-319-22416-9_26

Type: Book Chapter

Book Title: Towards Autonomous Robotic Systems - 16th Annual Conference, TAROS 2015, Liverpool, UK, September 8-10, 2015, Proceedings (2015)

Page Reference: 216-228

ISBN: 978-3-319-22415-2