Geek Answers Handbook

Algorithm for RC car

I'm looking for an algorithm and I don't know where to start!

I am trying to go from point A to point B in a Cartesian graph. The movement is limited by the RC engine: back, forward, forward-left and right-right (constant turning radius, the car either rotates completely or does not turn at all).

How would I build an algorithm that accepts the following:

turningRadius, initialPosition, initialOrientation, finalPosition

And gives an ordered set of steps to go to finalPosition?

Please note that I don’t care about the final orientation.

Thank!

EDIT: Note that this is not in a graph with discrete nodes, but in a continuous coordinate system

+5
source share
4 answers

, : 1) , ( ), B, 2) , B .

- . B , . , B , ( turningRadius). , B. , B.

, , : , B , , B . , B. , , .

( ) , B / ( " B ?" ) .

+5

, . " ". LaValle ( ) . , 14.4.2, "", RC, , .

" ". .

+1

* (a-star)? , . , . , , .

"", a-star . , 2 . , . . , .

0

! , , , ... , - , RC? ? ( , ... awwww.)

, , Building Problem Solvers, "AI" . ... , ! .: -)

[Well, I have to explain this last point: most of the “modern” AI methods that I have seen in practice have really returned to ideas for many years ... They have become practical now thanks to the relentless promotion of Moore's Law. Thus, a book written in 1993 still discusses fairly modern technology from what I personally saw. I would like to be shown a counter example!]

0
source

More articles:


All Articles