zoukankan      html  css  js  c++  java
  • UPenn

     
    The basic idea here is to try to construct a smooth function over the extent of the configuration space, which has high values when the robot is near to an obstacle and lower values when it's further away.
     
     
    If we can construct such a function, we can use it's gradient to guide the robot to the desired configuration.
     

     

      bowl-like shape

     

     

     

     

     

     

     

     

     This is sometimes referred to as sensor based planning

    laser sensor,...rangefinder

    In fact, they can incorporated into real time control schemes, running at tens of hertz using local sensor data
     

     downside is local minima

     

     

     

     hard to know local minima in advance

    One way to view these artificial potential field based schemes is as a useful heuristic.

      

    the use of a back tracking procedure to detect these situation

     


     

     

     

     

     

     

    visible graph approach 1

     

     trapezoidal decomposition approach 2

     

     grid based approach 3

     

     上面: discretize space and use dijkstra


     下面:Tree search

     

     

     

     

  • 相关阅读:
    windows 安装 anaconda
    全局路径规划--A*算法详解
    编码的种类
    request的encode和decode
    BGP的13条选路原则
    BGP路由黑洞 路由反射器 和联盟2021-07-28
    JMS-ActiveMQ-SpringBoot
    JMS-ActiveMQ-Spring
    JMS-中间件MQ-activeMQ入门
    spring-ssm整合
  • 原文地址:https://www.cnblogs.com/ecoflex/p/9790137.html
Copyright © 2011-2022 走看看