• DocumentCode
    138423
  • Title

    Time scaled collision cone based trajectory optimization approach for reactive planning in dynamic environments

  • Author

    Gopalakrishnan, Balasubramanian ; Singh, A.K. ; Krishna, K. Madhava

  • Author_Institution
    Robot. Res. Center, IIIT-Hyderabad, Hyderabad, India
  • fYear
    2014
  • fDate
    14-18 Sept. 2014
  • Firstpage
    4169
  • Lastpage
    4176
  • Abstract
    The current paper proposes a trajectory optimization approach for navigating a non-holonomic wheeled mobile robot in dynamic environments. The dynamic obstacle´s motion is not known and hence is represented by a band of predicted trajectories. The trajectory optimization can account for large number of predicted obstacle trajectories and seeks to avoid each predicted trajectory of every obstacle in the sensing range of the robot. The two primary contributions of the proposed trajectory optimization are (1): A computationally efficient method for computing the intersection space of collision avoidance constraints of large number of predicted obstacle trajectories. (2): A optimization framework to connect the current state to the solution space in time optimal fashion. The intersection/solution space computation is build on our earlier proposed concept of time scaled collision cone, which can be solved in closed form to obtain a set of formulae. These formulae describe how much and in what manner the temporal specification of a trajectory needs to be changed to avoid a given set of dynamic obstacles. This allows us to quickly evaluate solution space of time scaled collision cone over various candidate trajectories, thus reducing the problem of computing the intersection space to that of generating multiple homotopic trajectories. The optimization framework used to connect the current state to the solution space in time optimal fashion is based on the concept of non-linear time scaling, which induces a difference of convex form structure. Thus, on the theoretical side, we show that the various components of the proposed framework are computationally simple and involves solving sets of linear equations and using state of the art convex programming techniques. On the practical side we show that the proposed planner performs better than sampling based planners which treat dynamic obstacles as static over a short duration of time.
  • Keywords
    collision avoidance; convex programming; mobile robots; trajectory control; collision avoidance constraints; convex programming techniques; intersection-solution space; nonholonomic wheeled mobile robot; nonlinear time scaling; obstacle trajectory; reactive planning; robot navigation; time scaled collision cone; trajectory optimization approach; Acceleration; Collision avoidance; Dynamics; Optimization; Robots; Trajectory; Uncertainty;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Robots and Systems (IROS 2014), 2014 IEEE/RSJ International Conference on
  • Conference_Location
    Chicago, IL
  • Type

    conf

  • DOI
    10.1109/IROS.2014.6943150
  • Filename
    6943150