IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/328029.html
   My bibliography  Save this article

Key Parameters Estimation and Adaptive Warning Strategy for Rear-End Collision of Vehicle

Author

Listed:
  • Xiang Song
  • Xu Li
  • Weigong Zhang

Abstract

The rear-end collision warning system requires reliable warning decision mechanism to adapt the actual driving situation. To overcome the shortcomings of existing warning methods, an adaptive strategy is proposed to address the practical aspects of the collision warning problem. The proposed strategy is based on the parameter-adaptive and variable-threshold approaches. First, several key parameter estimation algorithms are developed to provide more accurate and reliable information for subsequent warning method. They include a two-stage algorithm which contains a Kalman filter and a Luenberger observer for relative acceleration estimation, a Bayesian theory-based algorithm of estimating the road friction coefficient, and an artificial neural network for estimating the driver’s reaction time. Further, the variable-threshold warning method is designed to achieve the global warning decision. In the method, the safety distance is employed to judge the dangerous state. The calculation method of the safety distance in this paper can be adaptively adjusted according to the different driving conditions of the leading vehicle. Due to the real-time estimation of the key parameters and the adaptive calculation of the warning threshold, the strategy can adapt to various road and driving conditions. Finally, the proposed strategy is evaluated through simulation and field tests. The experimental results validate the feasibility and effectiveness of the proposed strategy.

Suggested Citation

  • Xiang Song & Xu Li & Weigong Zhang, 2015. "Key Parameters Estimation and Adaptive Warning Strategy for Rear-End Collision of Vehicle," Mathematical Problems in Engineering, Hindawi, vol. 2015, pages 1-20, October.
  • Handle: RePEc:hin:jnlmpe:328029
    DOI: 10.1155/2015/328029
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2015/328029.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2015/328029.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2015/328029?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:328029. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.