Reputation
Top tag
Next privilege 200 Rep.
See reduced ads
Badges
2
Newest
 Scholar
Impact
~258 people reached

  • 0 posts edited
  • 0 helpful flags
  • 0 votes cast
Jul
11
awarded  Scholar
Jul
11
accepted A* search in hexagonal grid with minimum turn radius
Jul
11
comment A* search in hexagonal grid with minimum turn radius
I ended up using a discrete line algorithm for determining "dead ahead".
Jun
22
comment A* search in hexagonal grid with minimum turn radius
I'm trying to understand what you're saying here. It seems you have an assumption that my initial angle is 0 deg? And once I make the 60 deg turn, I'm now facing that direction or I'm somewhere between my previous angle and the additional 60?
Jun
22
awarded  Student
Jun
22
comment A* search in hexagonal grid with minimum turn radius
Traditionally we've adjusted the vehicle velocity to handle the corners planned for it. We would certainly like to push that back the other way such that we can optimize for time. With your suggestion of weighting the angle, I would need a function that could guarantee that my turn radius requirement is not violated in the aggregate (but I could still expand to individual cells when necessary).
Jun
22
asked A* search in hexagonal grid with minimum turn radius