Skip to main content

Geometry: An algorithm to select the most important vehicles in the traffic relative to the main vehicle?

I have the following data about the surrounding vehicles and the main vehicle(let call it E-vehicle): X,Y,Z in earth co-ordinates Velocity Yaw angle Pitch angle

I need to make use of these variables and write an algorithm to select the most important vehicles relative to ego vehicle. Example: To select the 10 most important vehicles from the 100 available in the traffic.

I have an algorithm which uses the distance between these surrounding vehicles and the ego vehicle and selects the nearest ones. However, this is not an efficient algorithm since it can also take into account the parked vehicles which might not be that important when compared a vehicle which is approaching the E-vehicle but is a little far away.

Any ideas on how I can use these variables to write a better algorithm would be appreciated.

Labels:

Comments

Post a Comment

Popular posts from this blog

[Community Question] Linear-algebra: Are linear transformations between infinite dimensional vector spaces always differentiable?

One of our user asked: In class we saw that every linear transformation is differentiable (since there's always a linear approximation for them) and we also saw that a differentiable function must be continuous, so it must be true that all linear operators are continuous, however, I just read that between infinite dimensional vector spaces this is not necessarily true. I would like to know where's the flaw in my reasoning (I suspect that linear transformations between infinite dimensional vector spaces are not always differentiable).
Post a Comment
Read more

[Community Question] Calculus: Asymptotic behavior of $\sum\limits_{n=0}^{\infty}x^{b^n}$

One of our user asked: This follow my previous post here , where Song has proven that $\forall b>1,\lim\limits_{x\to 1^{-}}\frac{1}{\ln(1-x)}\sum\limits_{n=0}^{\infty}x^{b^n}=-\frac{1}{\ln(b)}$ , that is to say : $$\forall b>1,\sum\limits_{n=0}^{\infty}x^{b^n}=-\log_b(1-x)+o_{x\to1^-}\left(\log_b(1-x)\right)$$ (The $o_{x\to1^-}\left(\log_b(1-x)\right)$ representing a function that is asymptotically smaller than $\log_b(1-x)$ when $x\to1^{-}$ , that is to say whose quotient by $\log_b(1-x)$ converges to $0$ as $x\to1^{-}$ , see small o notation ) So we have here a first asymptotical approximation of $\sum\limits_{n=0}^{\infty}x^{b^n}$ . I now want to take it one step further and refine the asymptotical behaviour, by proving a stronger result which I conjecture to be true (backed by numerical simulations) : $$\sum\limits_{n=0}^{\infty}x^{b^n}=-\log_b(1-x)+O_{x\to1^-}\left(1\right)$$ (The $O_{x\to1^-}\left(1\right)$ representing a function that is asymptotically bounded wh...
Post a Comment
Read more