For the maze of such a unique environment model, a Cartesian coordinate system based on a new path planning algorithm. The algorithm by identifying the location of robot moving direction and changes in the relationship quickly and easily realize the path memory, and upon arrival at the finishing point to the path through a simple optimization algorithm calculates the shortest path, and ultimately to realize the shortest path to return. The feasibility of this algorithm has passed wheeled robot instance to be confirmed.

基于笛卡儿坐标系的迷宫路径规划算法.pdf

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．