The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Sampling-based motion planning with deterministic μ-calculus specifications
Open accessAbstract
In this paper, we propose algorithms for the on-line computation of control programs for dynamical systems that provably satisfy a class of temporal logic specifications. Such specifications have recently been proposed in the literature as a powerful tool to synthesize provably correct control programs, for example for embedded systems and robotic applications. The proposed algorithms, generalizing state-of-the-art algorithms for point-to-point motion planning, incrementally build finite transition systems representing a discrete subset of dynamically feasible trajectories. At each iteration, local μ-calculus model-checking methods are used to establish whether the current transition system satisfies the specifications. Efficient sampling strategies are presented, ensuring the probabilistic completeness of the algorithms. We demonstrate the effectiveness of the proposed approach on simulation examples.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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 3×
“Such algorithms, e.g., Probabilistic RoadMaps (PRM) [14], and Rapidly-exploring Random Trees (RRT) [15] effectively build a finite transition system modeling a dynamical system, and check whether such finite transition contains a trajectory from the initial state to a desired goal state.”
BackgroundRandomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
Cited by
Incremental Sampling-based Algorithms for Optimal Motion Planning
Karaman, S., & Frazzoli, E. (2010) · Robotics: Science and Systems VI · doi:10.15607/rss.2010.vi.034 · Cited by 680
Self-citationReceding Horizon Temporal Logic Planning
Wongpiromsarn, T., Topcu, U., & Murray, R. M. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2195811 · Cited by 292
Formal Specification and Verification of Autonomous Robotic Systems: A Survey
Luckcuck, M., Farrell, M., Dennis, L. A., Dixon, C., & Fisher, M. (2020) · ACM Computing Surveys · doi:10.1145/3342355 · Cited by 281
Probabilistically safe motion planning to avoid dynamic obstacles with uncertain motion patterns
Aoude, G. S., Luders, B. D., Joseph, J. M., Roy, N., & How, J. P. (2013) · Autonomous Robots · doi:10.1007/s10514-013-9334-3 · Cited by 271
Formal Methods for Autonomous Systems
Wongpiromsarn, T., Ghasemi, M., Cubuktepe, M., Bakirtzis, G., Carr, S., Karabag, M. O., Neary, C., Gohari, P., & Topcu, U. (2023) · Foundations and Trends® in Systems and Control · doi:10.1561/2600000029 · Cited by 17
Metadata
- Authors
- Karaman, S., & Frazzoli, E.
- Venue
- Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference
- Publisher
- IEEE
- Published
- 2009-12
- Pages
- 2222-2229
- OpenAlex
- W2104241562
- Cited by
- 170
- References
- 2
- FWCI
- 10.11
- Type
- conference paper
- 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: Sampling-based motion planning with deterministic μ-calculus specifications. https://app.cochat.ai/papers/10.1109/cdc.2009.5400278
- The paper
- Karaman, S., & Frazzoli, E. (2009). Sampling-based motion planning with deterministic μ-calculus specifications. Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference. https://doi.org/10.1109/cdc.2009.5400278
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.