Multi-query TDSP for Path Planning in Time-varying Flow Fields
James Ju Heon Lee,Chanyeol Yoo,Stuart Anstee,Robert Fitch,James Ju Heon Lee,Chanyeol Yoo,Stuart Anstee,Robert Fitch
Many applications of path planning in time-varying flow fields, particularly in areas such as marine robotics and ship routing, can be modelled as instances of the time-varying shortest path (TDSP) problem. Although there are no known polynomial-time solutions to TDSP in general, our recent work has identified a tractable case where the flow is modelled as piecewise constant. Extending this method...
