Show simple item record

dc.contributor.authorTumova, Janaen_US
dc.contributor.authorBelta, Calinen_US
dc.contributor.authorRus, Danielaen_US
dc.contributor.authorSmith, Stephen L.en_US
dc.date.accessioned2018-07-02T14:39:58Z
dc.date.available2018-07-02T14:39:58Z
dc.date.issued2011-12-01
dc.identifierhttp://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000298258500003&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=6e74115fe3da270499c3d65c9b17d654
dc.identifier.citationStephen L Smith, Jana Tumova, Calin Belta, Daniela Rus. 2011. "Optimal path planning for surveillance with temporal-logic constraints." INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, v. 30, issue 14, pp. 1695 - 1708 (14).
dc.identifier.issn0278-3649
dc.identifier.urihttps://hdl.handle.net/2144/29732
dc.description.abstractIn this paper we present a method for automatically generating optimal robot paths satisfying high-level mission specifications. The motion of the robot in the environment is modeled as a weighted transition system. The mission is specified by an arbitrary linear temporal-logic (LTL) formula over propositions satisfied at the regions of a partitioned environment. The mission specification contains an optimizing proposition, which must be repeatedly satisfied. The cost function that we seek to minimize is the maximum time between satisfying instances of the optimizing proposition. For every environment model, and for every formula, our method computes a robot path that minimizes the cost function. The problem is motivated by applications in robotic monitoring and data-gathering. In this setting, the optimizing proposition is satisfied at all locations where data can be uploaded, and the LTL formula specifies a complex data-collection mission. Our method utilizes Büchi automata to produce an automaton (which can be thought of as a graph) whose runs satisfy the temporal-logic specification. We then present a graph algorithm that computes a run corresponding to the optimal robot path. We present an implementation for a robot performing data collection in a road-network platform.en_US
dc.description.sponsorshipThis material is based upon work supported in part by ONR-MURI (award N00014-09-1-1051), ARO (award W911NF-09-1-0088), and Masaryk University (grant numbers LH11065 and GD102/09/H042), and other funding sources (AFOSR YIP FA9550-09-1-0209, NSF CNS-1035588, NSF CNS-0834260). (N00014-09-1-1051 - ONR-MURI; W911NF-09-1-0088 - ARO; LH11065 - Masaryk University; GD102/09/H042 - Masaryk University; FA9550-09-1-0209 - AFOSR YIP; CNS-1035588 - NSF; CNS-0834260 - NSF)en_US
dc.format.extentp. 1695-1708en_US
dc.languageEnglish
dc.publisherSAGE PUBLICATIONS LTDen_US
dc.relation.ispartofINTERNATIONAL JOURNAL OF ROBOTICS RESEARCH
dc.subjectRoboticsen_US
dc.subjectMotion planningen_US
dc.subjectLTLen_US
dc.subjectMotion planningen_US
dc.subjectScience & technologyen_US
dc.subjectOptimal path planningen_US
dc.subjectTemporal logicen_US
dc.subjectAutomatic synthesisen_US
dc.subjectSystemsen_US
dc.subjectArtificial intelligence and image processingen_US
dc.subjectElectrical and electronic engineeringen_US
dc.subjectMechanical engineeringen_US
dc.subjectIndustrial engineering & automationen_US
dc.titleOptimal path planning for surveillance with temporal-logic constraintsen_US
dc.typeArticleen_US
dc.identifier.doi10.1177/0278364911417911
pubs.elements-sourceweb-of-scienceen_US
pubs.notesEmbargo: Not knownen_US
pubs.organisational-groupBoston Universityen_US
pubs.organisational-groupBoston University, College of Engineeringen_US
pubs.organisational-groupBoston University, College of Engineering, Department of Mechanical Engineeringen_US
pubs.publication-statusPublisheden_US


This item appears in the following Collection(s)

Show simple item record