Simulating vehicles that doesn't collide with each other

Question

Wenzel Gaßner 2019-12-13

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/496493-simulating-vehicles-that-doesn-t-collide-with-each-other

回答： Dheeraj Singh 2019-12-16

采纳的回答： Dheeraj Singh

Hey,

I’m trying to simulate Boid like vehicles.

Now I want that they “care” for each other and don’t crash in another.

Is there a good algorithm for that?

My Idea would be kind of this:

I’m calculating the euclidean distance between all Boids at every iteration and store the distance in a matrix.

After that I extract the indices of all matrix values smaller than ε, so now I know which two Boids are to close.

Now I want that they change velocities so it’s like an inelastic kick. And hopefully this is enough to “kick” them out of the ε radius.

But I think this is not a good way to do this, it will be very time consuming.

What do you think?

I’m a beginner at programming so it would be helpful if there is a “simple” solution.

Best,

Wenzel

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

请先登录，再回答此问题。

Answer 1

Dheeraj Singh 2019-12-16

1
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/496493-simulating-vehicles-that-doesn-t-collide-with-each-other#answer_406526

One of basic approaches, as you have suggested, can be based on Euclidean distance between the two vehicles. This can be achieved using Vector Field Histogram block.

You can refer to the following example for more detail about implementation:

https://in.mathworks.com/help/robotics/examples/control-and-simulate-multiple-warehouse-robots.html

There are other algorithms specifically for multi agent collision avoidance such as: Velocity Obstacles, Reciprocal Velocity obstacles etc.

Also, if you just want to plan paths for multiple agents from start to goal locations there are different algorithms such as: Conflict based search, M* etc.

But they are quite complex to implement. For simple tasks the first approach should work fine.