Identifying a stopping place for an autonomous vehicle

A computer-implemented method comprising:

• receiving, by one or more processors, data identifying one or more potential stopping places for a vehicle within a region;
• determining, by the one or more processors, one or more feasible stopping places among the one or more potential stopping places, wherein at least one potential stopping place among the one or more potential stopping places is determined to be a feasible stopping place among the one or more feasible stopping places based on:
• an amount of time elapsed since the at least one potential stopping place was determined to be infeasible for parking stopping exceeding a first threshold value, and
• a reason for the determination that the at least one potential stopping place is infeasible for stopping;
• receiving, by the one or more processors, data representing perceptions of conditions at the one or more feasible stopping places;
• and
• updating, by the one or more processors, data indicative of the one or more feasible stopping places based on the perceptions of conditions to include one or more updated feasible stopping places.

A system comprising:

• at least one programmable processor;
• and
• a machine-readable medium storing instructions that, when executed by the at least one processor, cause the at least one programmable processor to perform operations comprising:
• receiving data identifying one or more potential stopping places for a vehicle within a region;
• determining one or more feasible stopping places among the one or more potential stopping places, wherein at least one potential stopping place among the one or more potential stopping places is determined to be a feasible stopping place among the one or more feasible stopping places based on:
• an amount of time elapsed since the at least one potential stopping place was determined to be infeasible for parking stopping exceeding a first threshold value, and
• a reason for the determination that the at least one potential stopping place is infeasible for stopping;
• receiving data representing perceptions of conditions at the one or more feasible stopping places;
• and
• updating data indicative of the one or more feasible stopping places based on the perceptions of conditions to include one or more updated feasible stopping places.

A non-transitory computer program product storing instructions that, when executed by at least one programmable processor, cause the at least one programmable processor to perform operations comprising:

• receiving data identifying one or more potential stopping places for a vehicle within a region;
• determining one or more feasible stopping places among the one or more potential stopping places, wherein at least one potential stopping place among the one or more potential stopping places is determined to be a feasible stopping place among the one or more feasible stopping places based on:
• an amount of time elapsed since the at least one potential stopping place was determined to be infeasible for parking stopping exceeding a first threshold value, and
• a reason for the determination that the at least one potential stopping place is infeasible for stopping;
• receiving data representing perceptions of conditions at the one or more feasible stopping places;
• and
• updating data indicative of the one or more feasible stopping places based on the perceptions of conditions to include one or more updated feasible stopping places.