The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Integrated online trajectory planning and optimization in distinctive topologies
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
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
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 1×
“Waypoint sampling follows the probabilistic roadmaps (PRM) approach [25].”
BackgroundThe dynamic window approach to collision avoidance
Fox, D., Burgard, W., & Thrun, S. (1997) · IEEE Robotics & Automation Magazine · doi:10.1109/100.580977 · Cited by 3,771
G2o: A general framework for graph optimization
Kummerle, R., Grisetti, G., Strasdat, H., Konolige, K., & Burgard, W. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5979949 · Cited by 1,982
CHOMP: Gradient optimization techniques for efficient motion planning
Ratliff, N., Zucker, M., Bagnell, J. A., & Srinivasa, S. (2009) · 2009 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2009.5152817 · Cited by 992
STOMP: Stochastic trajectory optimization for motion planning
Kalakrishnan, M., Chitta, S., Theodorou, E., Pastor, P., & Schaal, S. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5980280 · Cited by 876
A sweepline algorithm for Voronoi diagrams
Fortune, S. (1986) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/10515.10549 · Cited by 340
Soft constraints and exact penalty functions in model predictive control
Kerrigan, E. C., & Maciejowski, J. (2000) · Spiral (Imperial College London) · Cited by 233
Efficient trajectory optimization using a sparse model
Rosmann, C., Feiten, W., Wosch, T., Hoffmann, F., & Bertram, T. (2013) · 2013 European Conference on Mobile Robots · doi:10.1109/ecmr.2013.6698833 · Cited by 197
Self-citationReactive Path Deformation for Nonholonomic Mobile Robots
Lamiraux, F., Bonnafous, D., & Lefebvre, O. (2004) · IEEE Transactions on Robotics · doi:10.1109/tro.2004.829459 · Cited by 173
Cited by
Motion Planning for Autonomous Driving: The State of the Art and Future Perspectives
Teng, S., Hu, X., Deng, P., Li, B., Li, Y., Ai, Y., Yang, D., Li, L., Xuanyuan, Z., Zhu, F., et al. (2023) · IEEE Transactions on Intelligent Vehicles · doi:10.1109/tiv.2023.3274536 · Cited by 590
Path Smoothing Techniques in Robot Navigation: State-of-the-Art, Current and Future Challenges
Ravankar, A., Ravankar, A. A., Kobayashi, Y., Hoshino, Y., & Peng, C.-C. (2018) · Sensors · doi:10.3390/s18093170 · Cited by 314
RAPTOR: Robust and Perception-Aware Trajectory Replanning for Quadrotor Fast Flight
Zhou, B., Pan, J., Gao, F., & Shen, S. (2021) · IEEE Transactions on Robotics · doi:10.1109/tro.2021.3071527 · Cited by 308
Metadata
- Authors
- Rösmann, C., Hoffmann, F., & Bertram, T.
- Venue
- Robotics and Autonomous Systems
- Publisher
- Elsevier BV
- Published
- 2017-02
- Volume
- 88
- Pages
- 142-153
- ISSN
- 0921-8890 (ISSN-L)
- OpenAlex
- W2549200707
- Cited by
- 324
- References
- 23
- FWCI
- 6.62
- Type
- journal article
- 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: Integrated online trajectory planning and optimization in distinctive topologies. https://app.cochat.ai/papers/10.1016/j.robot.2016.11.007
- The paper
- Rösmann, C., Hoffmann, F., & Bertram, T. (2017). Integrated online trajectory planning and optimization in distinctive topologies. Robotics and Autonomous Systems. https://doi.org/10.1016/j.robot.2016.11.007
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.