Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2506.01141

Help | Advanced Search

Computer Science > Robotics

arXiv:2506.01141 (cs)
[Submitted on 1 Jun 2025 (v1) , last revised 14 Sep 2025 (this version, v2)]

Title: Standing Tall: Robust Fall Prediction for Bipedal Robots

Title: 挺直站立:双足机器人的鲁棒跌倒预测

Authors:Gokul Prabhakaran, Jessy W. Grizzle, M. Eva Mungai
Abstract: This paper extends the fall prediction algorithm from Mungai et al.(2024) to a real-time/online setting, implemented in both hardware and simulation. This yields results comparable to the offline version, maintaining a zero false positive rate, sufficient lead time, and accurate lead time prediction. Additionally, it achieves a high recovery rate. The paper also evaluates the fall prediction algorithm against omnidirectional faults and introduces an improved algorithm capable of reliably predicting falls and lead times across a wider range of faults in full-sized robots. Compared to Mungai et al.(2024), the proposed algorithm performs significantly better across all metrics, such as false positive rate, lead time, accuracy, and response time, demonstrating the algorithm's efficacy for real-time fall prediction in bipedal robots.
Abstract: 本文将Mungai等人(2024)的跌倒预测算法扩展到实时/在线设置,在硬件和仿真中均进行了实现。这产生了与离线版本相当的结果,保持了零误报率、足够的提前时间以及准确的提前时间预测。此外,它还实现了高恢复率。本文还针对全向故障评估了跌倒预测算法,并引入了一种改进的算法,能够在更大范围的故障中可靠地预测跌倒和提前时间,适用于全尺寸机器人。与Mungai等人(2024)相比,所提出的算法在所有指标上表现显著更好,例如误报率、提前时间、准确性和响应时间,证明了该算法在双足机器人实时跌倒预测中的有效性。
Comments: This work has been submitted to the IEEE for possible publication
Subjects: Robotics (cs.RO)
Cite as: arXiv:2506.01141 [cs.RO]
  (or arXiv:2506.01141v2 [cs.RO] for this version)
  https://doi.org/10.48550/arXiv.2506.01141
arXiv-issued DOI via DataCite

Submission history

From: M. Eva Mungai [view email]
[v1] Sun, 1 Jun 2025 19:51:05 UTC (1,524 KB)
[v2] Sun, 14 Sep 2025 00:38:18 UTC (1,524 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.RO
< prev   |   next >
new | recent | 2025-06
Change to browse by:
cs

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号