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

feat(freespace_planning_algorithms): Tools for Python wrapper of freespace planning algorithms #28

Closed
wants to merge 4 commits into from

Conversation

TakumIto
Copy link

Description

Debug tools for Python wrapper of freespace planning algorithms. New features are as follows:

  • GUI to generate manual costmap
  • Search for trajectory to goal on grid
  • GUI to visualize the searched results and the trajectories

See README for the detailed explanation.

Related links

Python wrapper of A* algorithms PR#6398

Interface changes

There are no changes in interfaces.

Pre-review checklist for the PR author

The PR author must check the checkboxes below when creating the PR.

In-review checklist for the PR reviewers

The PR reviewers must check the checkboxes below before approval.

  • The PR follows the pull request guidelines.
  • The PR has been properly tested.
  • The PR has been reviewed by the code owners.

Post-review checklist for the PR author

The PR author must check the checkboxes below before merging.

  • There are no open discussions or they are tracked via tickets.
  • The PR is ready for merge.

After all checkboxes are checked, anyone who has write access can merge the PR.

Takumi Ito added 2 commits May 20, 2024 13:24
Signed-off-by: Takumi Ito <takumi.ito@tier4.jp>
Signed-off-by: Takumi Ito <takumi.ito@tier4.jp>
@TakumIto
Copy link
Author

I closed this PR because of some problem in the code temporarily.
Soon I will reopen it I fix it.

Signed-off-by: Takumi Ito <takumi.ito@tier4.jp>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants