Graph exploration forward search

Abstract

Provided are methods for graph forward search exploration, which can include detecting a plurality of obstacles along a first trajectory of a vehicle. Some methods described also include determining a plurality of valid combinations of a plurality of trajectories to handle the plurality of obstacles. Some methods described also include generating a reduced decision tree based at least on the valid combinations of the plurality of trajectories by at least excluding a second trajectory of the plurality of trajectories associated with an obstacle of a plurality of obstacles based on a position of the obstacle being outside of a corridor defined by a spatial range and/or a temporal range. Some methods described also include selecting an optimal trajectory of the vehicle from the plurality of trajectories of the reduced decision tree. Systems and computer program products are also provided.