Ask Your Question

octomap, velodyne and clustering

asked 2013-02-28 08:41:21 -0500

brice rebsamen gravatar image

I would like to know if it would be possible to process velodyne data with an octomap.

I am not interested in building a huge map of the environment, i.e. for SLAM. But I need to know my surrounding for immediate planning and obstacle avoidance, let say about 70m around the robot. That means the octomap would be a rolling map in a way. I would need a resolution of about 10-20cm if possible and an update rate close to real time (i.e 10Hz).

In particular I am really interested in the ray tracing ability of the octomap.

Besides, I want to be able to retrieve the obstacles from the map, so that I can track them and classify them (cars, pedestrians, bicycles, etc). This would require some sort of clustering technique, i.e. connected component analysis...

Also, my planner requires a list of obstacles coordinates, so I was wondering if I could query the map to return me all the voxels (at a certain resolution) that are occupied. I saw that the search function was taking a x,y,z coordinates, does it mean that I'd have to do a triple loop search on a volume of voxels and test for occupancy? I feel there could be a better approach...

If velodyne data is too much data, I guess I can consider downsampling (spatially and temporally)... So I'd like to know what others people here have tried before I get started.

edit retag flag offensive close merge delete



I have never tried it, but this sounds like a good idea.

joq gravatar image joq  ( 2013-02-28 16:05:28 -0500 )edit

By the way, for general OctoMap questions (not specific to ROS), we also have a mailing list:

AHornung gravatar image AHornung  ( 2013-03-03 21:35:58 -0500 )edit

1 Answer

Sort by ยป oldest newest most voted

answered 2013-02-28 22:55:22 -0500

AHornung gravatar image

You can check our new paper about OctoMap (PDF preprint) for a detailed analysis of the performance.

Looking at our outdoor dataset (50m maxrange), it will take about 1.7 seconds to insert 700000 points into the map at 20cm resolution. Most of this time will be spent in the raycasting operation. So I would strongy suggest downsampling the initial clouds, e.g. with a PCL voxel grid first. Something below the OctoMap resolution (5-10cm) should be fine so you don't lose too much detail.

To obtain all obstacles in the map, simply traverse it with a leaf iterator:

This is the most efficient way, much faster than looping over all possible coordinates.

For finding connected components, best work on OcTreeKeys directly. You might find some code in the class "OcTreeLUT" useful for neighbor finding, but we're not really using that code anymore (consider it experimental and untested).

edit flag offensive delete link more

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account.

Add Answer

Question Tools

1 follower


Asked: 2013-02-28 08:41:21 -0500

Seen: 1,303 times

Last updated: Feb 28 '13