Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 185

The DOI matches its Crossref record.

Receding horizon path planning with implicit safety guarantees

Schouwenaars, T., How, J., Feron, E. · 2004 · Proceedings of the 2004 American Control Conference

Abstract

This paper extends a recently developed approach to optimal path planning of autonomous vehicles, based on mixed integer linear programming (MILP), to account for safety. We consider the case of a single vehicle navigating through a cluttered environment which is only known within a certain detection radius around the vehicle. A receding horizon strategy is presented with hard terminal constraints that guarantee feasibility of the MILP problem at all future time steps. The trajectory computed at each iteration is constrained to end in a so called basis state, in which the vehicle can safely remain for an indefinite period of time. The principle is applied to the case of a UAV with limited turn rate and minimum speed requirements, for which safety conditions are derived in the form of loiter circles. The latter need not be known ahead of time and are implicitly computed online. An example scenario is presented that illustrates the necessity of these safety constraints when the knowledge of the environment is limited and/or hard real-time restrictions are given.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.23919/acc.2004.1384742

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 185

Metadata

Authors
Schouwenaars, T., How, J., & Feron, E.
Venue
Proceedings of the 2004 American Control Conference
Publisher
IEEE
Published
2004
Pages
5576-5581 vol.6
ISSN
0743-1619 (ISSN-L)
OpenAlex
W2114396319
Cited by
185
References
0
FWCI
6.76
Type
conference paper
Language
en
Open access
closed

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: Receding horizon path planning with implicit safety guarantees. https://app.cochat.ai/papers/10.23919/acc.2004.1384742
The paper
Schouwenaars, T., How, J., & Feron, E. (2004). Receding horizon path planning with implicit safety guarantees. Proceedings of the 2004 American Control Conference. https://doi.org/10.23919/acc.2004.1384742

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.