The goal is to ensure that after we have more than the max number of obstacle observations, we preemtively start to drop the oldest ones out of the list.
This will help us guarntee an upper bound on the number of obstacle-calculations that we have to do each loop while path planning.
Update the temporary obstacle observations to be a circular buffer, or something similar - https://stackoverflow.com/questions/4151320/efficient-circular-buffer
The goal is to ensure that after we have more than the max number of obstacle observations, we preemtively start to drop the oldest ones out of the list.
This will help us guarntee an upper bound on the number of obstacle-calculations that we have to do each loop while path planning.