Level Up Your Cyber Defense with External Threat Management
See every risk before it hits. From exposed data to dark web chatter. All in one unified view.
Move beyond alerts. Gain full visibility, context, and control over your external attack surface to stay ahead of every threat.
Try for Free
Our Free Plans just got better! | Auth0
With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
Cell decomposition is one of the first applicable solution for path planning - robot path planning.
The algorithm aims to find free areas (cells not occupied by obstacles) in the configuration space, and build a graph of adjacency for these cells.
The E* algorithm is a path planner for (mobile) robotics. Unlike A*, which constrains movements to graph edges, it produces smooth trajectories by interpolating between edges. Like D*, it supports dynamic replanning after local path cost changes.