• Velocity Obstacle


    Velocity Obstacle

      Two circular objects A,B, at time t(0), with velocity V(A),V(B). A represent the robot, and B represent obstacle.

        

      Collision Cone:

         

      V(A,B) is the relative velocity of A&B. V(A,B) = V(A) - V(B). And λ(A,B) is the line of V(A,B).

           

       By translating CC(A,B) by V(B),we get absolute Velocity Obstacle VO:

        

        

      The VO partitions the absolute velocities of A into avoiding & colliding velocities. Selecting V(A) outside of VO would avoid collision with B:

        

      Velocities on the boundaries of VO would result in A grazing B.

      To avoid multiple obstacles, we consider the union of the individual velocity obstacles:

        

      Since VO is based on a linear approximation of the obstacle's trajectory, using it to predict remote collisions may be inaccurate.
      To account for imminent collisions:

        

       

     【Avoidance Maneuver

      躲避策略。

      

      Feasible Acceleration:   

      RV: Reachable Velocity:

      

      

      Reachable Avoidance Velocity (RAV):

        

      

       A maneuver avoiding obstacle B can be computed by selecting any velocity in RAV.

    Structure of the Avoidance Maneuvers

      躲避策略的结构。

  • 相关阅读:
    JS 日期加多少天,减多少天
    SQL 触发器
    SGU100
    连续子数组的最大和
    字符串的排列
    二叉搜索树与双向链表
    数组中出现次数超过一半的数字
    复杂链表的复制
    二叉树中和为某一值的路径
    二叉搜索树的后序遍历序列
  • 原文地址:https://www.cnblogs.com/tekkaman/p/9533666.html
Copyright © 2020-2023  润新知