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

Untracked detection & tracked obstacle map publishing, integrating updated sensor fusion algorithm with the ObstacleMap interface #182

Open
wants to merge 43 commits into
base: main
Choose a base branch
from

Conversation

pliam1105
Copy link
Contributor

Publishes untracked (but color labeled) obstacle detections and tracked (using a simple euclidean distance object tracking as it was done until now, but also using the detected colors for matching the objects, the positions being the centroids of the published object point clouds) & labeled obstacle maps, including checking for obstacles that have been missing while on the FoV of the robot (by projecting the centroid to the camera plane) and removing them, but not removing obstacles that the robot just doesn't see because it's faced the other way, hopefully improving consistency. There are still duplicates sometimes, due to minor position changes, so I'm hoping to implement EKF (probabilistic) mapping (currently troubleshooting that) to mitigate that and hopefully have more consistent and accurate buoy positions and matching between detections.

…tected point clouds from the image to the point cloud.
…de each detected object's bounding box (when projected onto the image), with the respective labels and probabilities, colcon build succesful, didn't test yet
…throws some out of range errors but I catched them and made them warnings and it seems to work fine)
…ions in resize, may be the wrong order in terms of channels so may need to change the order both in resize() and in at() again), seems to correctly select the points in the objects detected
…l meaningful clusters based on the detections
…on, need to find a euclidean clustering algorithm for n-dimensional data or with customizable distance function, or just one that takes color into account (there are some in PCL but they mostly rely on color thresholds or difference limits rather than adding their squared difference to the distance) or implement it from scratch (and KD-tree from scratch?)
…izing them in RViz (not tested or built yet)
…formulas for the choosing & matching metrics
…n the actual object, but more testing/tuning would be good)
… by publishing unorganized point clouds (channels don't matter anyways in visualization)
@pliam1105 pliam1105 added the enhancement New feature or request label Jan 31, 2025
@pliam1105 pliam1105 self-assigned this Jan 31, 2025
@pliam1105 pliam1105 linked an issue Feb 12, 2025 that may be closed by this pull request
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request
Projects
None yet
Development

Successfully merging this pull request may close these issues.

Improve obstacle tracking
2 participants