טוען...
Path Planning for Non-Circular, Non-Holonomic Robots in Highly Cluttered Environments
This paper presents an algorithm for finding a solution to the problem of planning a feasible path for a slender autonomous mobile robot in a large and cluttered environment. The presented approach is based on performing a graph search on a kinodynamic-feasible lattice state space of high resolution...
שמור ב:
| הוצא לאור ב: | Sensors (Basel) |
|---|---|
| Main Authors: | , , |
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
MDPI
2017
|
| נושאים: | |
| גישה מקוונת: | https://ncbi.nlm.nih.gov/pmc/articles/PMC5579725/ https://ncbi.nlm.nih.gov/pubmed/28809785 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.3390/s17081876 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|