The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Optimality and Robustness in Multi-Robot Path Planning with Temporal Logic Constraints
Open accessAbstract
In this paper we present a method for automatic planning of optimal paths for a group of robots that satisfy a common high-level mission specification. The motion of each robot is modeled as a weighted transition system, and the mission is given as a linear temporal logic (LTL) formula over a set of propositions satisfied at the regions of the environment. In addition, an optimizing proposition must repeatedly be satisfied. The goal is to minimize a cost function that captures the maximum time between successive satisfactions of the optimizing proposition while guaranteeing that the formula is satisfied. When the robots can follow a given trajectory exactly, our method computes a set of optimal satisfying paths that minimize the cost function and satisfy the LTL formula. However, if the traveling times of the robots are uncertain, then the robots may not be able to follow a given trajectory exactly, possibly violating the LTL formula during deployment. We handle such cases by leveraging the communication capabilities of the robots to guarantee correctness during deployment and provide bounds on the deviation from the optimal values. We implement and experimentally evaluate our method for various persistent surveillance tasks in a road network environment.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Exploring Network Structure, Dynamics, and Function Using NetworkX
Hagberg, A. A., Schult, D. A., & Swart, P. J. (2008) · Proceedings of the Python in Science Conference · doi:10.25080/tcwv9851 · Cited by 7,477
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Kavraki, L. E., Svestka, P., Latombe, J.-C., & Overmars, M. H. (1996) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.508439 · Cited by 6,343 · cited 2×
“Alternatively, randomized sampling-based algorithms such as Probabilistic Road Map (PRM) (Kavraki et al., 1996) or Rapidly-Exploring Random Tree (RRT) (Ku↵ner and LaValle, 2000) can be used to find admissible paths.”
BackgroundMethod
Cited by
A survey of human-centered intelligent robots: issues and challenges
He, W., Li, Z., & Chen, C. L. P. (2017) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2017.7510604 · Cited by 297
An intelligence-based hybrid PSO-SA for mobile robot path planning in warehouse
Lin, S., Liu, A., Wang, J., & Kong, X. (2023) · Journal of Computational Science · doi:10.1016/j.jocs.2022.101938 · Cited by 150
Metadata
- Authors
- Ulusoy, A., Smith, S. L., Ding, X. C., Belta, C., & Rus, D.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2013-07
- Volume
- 32
- Issue
- 8
- Pages
- 889-911
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W2077245982
- Cited by
- 183
- References
- 2
- FWCI
- 11.15
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Optimality and Robustness in Multi-Robot Path Planning with Temporal Logic Constraints. https://app.cochat.ai/papers/10.1177/0278364913487931
- The paper
- Ulusoy, A., Smith, S. L., Ding, X. C., Belta, C., & Rus, D. (2013). Optimality and Robustness in Multi-Robot Path Planning with Temporal Logic Constraints. The International Journal of Robotics Research. https://doi.org/10.1177/0278364913487931
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.