Since any-time behavior allows a tradeoff between solution quality and search time, any-time algorithms are very useful for automotive applications in which robustness and real-time processing plays a significant role. In general, any-time algorithms have the property that a solution is ready whenever the algorithm is stopped and the solution improves with additional computing time. We make use of this for obstacle tracking. Our obstacle tracking scheme is based on finding feature correspondences. First, we apply a restricted matching strategy to obtain a first solution to the correspondence problem. Afterwards, while computing time remains, the current solution is improved using an optimal matching strategy. Following this strategy, a processing in real-time can be ensured at any time.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Any-time behavior for obstacle tracking


    Contributors:
    Sobottka, K. (author) / Bunke, H. (author)


    Publication date :

    1999-01-01


    Size :

    629224 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Anytime Behavior for Obstacle Tracking

    Sobottka, K. / Bunke, H. / IEEE et al. | British Library Conference Proceedings | 1999


    Real-time Obstacle Map Building with Target Tracking

    Kang, Yeonsik / Caveney, Derek S. / Hedrick, J. Karl | AIAA | 2008


    Obstacle avoidance during target tracking

    ZHAO CONG / SHEN SHAOJIE / QIAN JIE et al. | European Patent Office | 2025

    Free access

    Obstacle tracking method, tracking device and vehicle

    ZHANG SHIJIA / CAO BIN | European Patent Office | 2022

    Free access

    OBSTACLE AVOIDANCE DURING TARGET TRACKING

    ZHAO CONG / SHEN SHAOJIE / QIAN JIE et al. | European Patent Office | 2025

    Free access