search

jsford / nanoplan

nanoplan is a header-only C++11 library for search-based robot planning.
MIT License
15 stars 3 forks source link

Future plans for nanoplan #2

Closed DJuego closed 3 years ago

DJuego commented 3 years ago

The implementation of *D Lite** will be an important milestone in the project. Already with that I would be quite satisfied. :-)

However, have you thought about implementing some other state-of-the-art algorithm in the future in nanoplan? Is there already a to-do list? I love the minimalist philosophy that the project exudes!

DJuego

jsford commented 3 years ago

Hi DJuego!

This is a side project for me right now, but I'd love to add more interesting algorithms. What kind of things would you like to see?

DJuego commented 3 years ago

Well. My main interests in approaching nanoplan are robotics and video games. I would need to work with your library to develop specific needs.

nanoplan currently supports Dijkstra, A, Lifelong Planning A, and (Coming Soon!) D* Lite.

Already simply supporting Dijkstra, A, Lifelong Planning A and D Lite I would be "satisfied" for the time being :yum:. I understand that the DLite implementation is not yet finished... Right? ("Coming Soon!")

DJuego

jsford commented 3 years ago

That's right. Dijkstra, A, and LPA are working, but I wouldn't say they are exhaustively tested. D* Lite is mostly implemented, but seems to be buggy. I haven't had any time to work on it lately.

DJuego commented 3 years ago

Don't worry. Priorities are priorities, @jsford .

Thank you for your update! and, again, thank you for your contribution. If you only manage to support what you have it would already be a very valuable contribution. As I said it brings together a number of unique features that I have not seen in any other library on this topic.

DJuego