Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Algorithm #5

Open
hjr553199215 opened this issue Jul 4, 2019 · 10 comments
Open

Algorithm #5

hjr553199215 opened this issue Jul 4, 2019 · 10 comments

Comments

@hjr553199215
Copy link

Hello, can I learn about your main algorithm or related paper ?

@peterWon
Copy link
Owner

peterWon commented Jul 4, 2019

@hjr553199215 of cause, hold on, let me 找一找!

@hjr553199215
Copy link
Author

Thank you

@hjr553199215
Copy link
Author

@peterWon 您好,您如果方便的话,可不可以加一下您的微信,最近在学习覆盖路径规划,有些问题想请教您。

@hjr553199215
Copy link
Author

My email : [email protected]

@peterWon
Copy link
Owner

peterWon commented Jul 5, 2019

@hjr553199215 不好意思,很久没做这个研究了,原论文我找不到出处了,ROS集成了一些覆盖路径的方法,在这里,你可以看看有么有帮助.http://wiki.ros.org/ipa_room_exploration

@hjr553199215
Copy link
Author

@peterWon 没事没事,麻烦您了,不知道方不方便加一下您的微信,想向您再请教一些问题。

@hjr553199215
Copy link
Author

您好,还想请问您一下,这套程序如何才能运行自己采集生成的地图呢?

@zhangstar3
Copy link

@peterWon 您好,打扰了,请问在路径点的选择时,您判断当前点的四周邻居点时,switch中是判断的是什么情形?十分期待您的回复!

@hjr553199215
Copy link
Author

@zhangstar3 你好,你也在做这个覆盖式的路径规划吗?

@zhangstar3
Copy link

@hjr553199215 自己有点兴趣,想去探索一下,你清楚程序中对周围点遍历的意思吗?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants