Force-based agents get a force for every obstacle neighbor (so long as the force formulation's fall-off limit is not nearer than the obstacle). For these agents, more distant obstacles that are occluded by nearer obstacles should be automatically omitted from the neighbor set to avoid redundant, meaningless forces.
This becomes especially apparent in the maze scenario.
One of the design issues is to determine if complete occlusion is necessary, or if partial occlusion is sufficient to exclude an obstacle from the neighbor set. At the end of the day, the solution is probably a combination of occlusion and distance.
NOTE: This issue does not affect the RVO-derived models because the line constraints implicitly account for occlusion.
Force-based agents get a force for every obstacle neighbor (so long as the force formulation's fall-off limit is not nearer than the obstacle). For these agents, more distant obstacles that are occluded by nearer obstacles should be automatically omitted from the neighbor set to avoid redundant, meaningless forces.
This becomes especially apparent in the maze scenario.
One of the design issues is to determine if complete occlusion is necessary, or if partial occlusion is sufficient to exclude an obstacle from the neighbor set. At the end of the day, the solution is probably a combination of occlusion and distance.
NOTE: This issue does not affect the RVO-derived models because the line constraints implicitly account for occlusion.