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

Qu, H., Kolling, A. and Veres, S.M. (2015) Computing Time-Optimal Clearing Strategies for Pursuit-Evasion Problems with Linear Programming. In: Towards Autonomous Robotic Systems. Lecture Notes in Computer Science, 9287 . Springer Verlag , pp. 216-228. ISBN 978-3-319-22415-2

Abstract

Metadata

Authors/Creators:
  • Qu, H.
  • Kolling, A.
  • Veres, S.M.
Copyright, Publisher and Additional Information: © 2015 Springer International Publishing Switzerland. This is an author produced version of a paper subsequently published in Towards Autonomous Robotic Systems. Uploaded in accordance with the publisher's self-archiving policy.
Dates:
  • Published: 18 July 2015
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Automatic Control and Systems Engineering (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 03 Feb 2016 16:54
Last Modified: 13 Nov 2016 00:46
Published Version: http://dx.doi.org/10.1007/978-3-319-22416-9_26
Status: Published
Publisher: Springer Verlag
Series Name: Lecture Notes in Computer Science
Refereed: Yes
Identification Number: https://doi.org/10.1007/978-3-319-22416-9_26
Related URLs:

Share / Export

Statistics