Back to results
US 11,768,080 B2Granted
Optimal route searching device and operation method thereof
AssigneeSamsung Electronics Co., Ltd.
InventorsMinsoo Kim, Jaeheung Park, Joonwoo Ahn
Life of this patent
Estimating the term…
Abstract
An operation method of an optimal route searching device includes: acquiring topology transformed map information; extracting a plurality of candidate routes based on the topology transformed map information; calculating a travel cost for each of the plurality of candidate routes based on a cost function; and determining a candidate route corresponding to a lowest cost one of the calculated travel costs as a travelling route.
Claims15
An operation method of an optimal route searching device, the operation method comprising:
- receiving map information covering a parking area, by electronically communicating with an external device;
- generating topology transformed map information based on the received map information and extracting information related to actual parking space in a parking area, roads for moving between parking spaces, and intersecting roads, the extracted information used to generate visual information representing essential edges corresponding to roads including parking spaces, optional edges corresponding to roads other than the essential edges, and nodes corresponding to cross points between roads;
- extracting a plurality of candidate routes based on the topology transformed map information;
- determining whether the plurality of candidate routes are extracted a determined number of times, wherein the determined number of times corresponds to a number of generation iterations based on a genetic algorithm and varies depending on a number of optional edges;
- halting the extracting of the plurality of candidate routes based on the generation iterations equaling the determined number;
- calculating a travel cost for each of the plurality of candidate routes based on a cost function;
- and
- determining a candidate route corresponding to a lowest cost one of the calculated travel costs as a travelling route.
5 more elements
An optimal route searching device comprising:
- processing circuitry configured to
- receive map information covering a parking area, by electronically communicating with an external device;
- generate a topology transformation based on the received map information and extracting information related to actual parking space in a parking area, roads for moving between parking spaces, and intersecting roads, the extracted information used to generate visual information representing essential edges corresponding to roads including parking spaces, optional edges corresponding to roads other than the essential edges, and nodes corresponding to cross points between roads;
- and
- extract a plurality of candidate routes based on topology transformed map information,
- determine whether the plurality of candidate routes are extracted a determined number of times, wherein the determined number of times corresponds to a number of generation iterations based on a genetic algorithm and varies depending on a number of optional edges;
- halt the extracting of the plurality of candidate routes based on the generation iterations equaling the determined number;
- calculate a travel cost for each of the plurality of candidate routes based on a cost function, and
- determine a candidate route corresponding to a lowest cost one of the calculated travel costs as a travelling route.
6 more elements
A host vehicle comprising:
- at least one sensor;
- a vehicle controller;
- and
- processing circuitry configured to
- receive map information covering a parking area, by electronically communicating with an external device;
- generate a topology transformation based on the received map information and extracting information related to actual parking space in a parking area, roads for moving between parking spaces, and intersecting roads, the extracted information used to generate visual information representing essential edges corresponding to roads including parking spaces, optional edges corresponding to roads other than the essential edges, and nodes corresponding to cross points between roads;
- and
- extract a plurality of candidate routes based on topology transformed map information,
- determine whether the plurality of candidate routes are extracted a determined number of times, wherein the determined number of times corresponds to a number of generation iterations based on a genetic algorithm and varies depending on a number of optional edges;
- halt the extracting of the plurality of candidate routes based on the generation iterations equaling the determined number;
- calculate a travel cost for each of the plurality of candidate routes based on a cost function, and
- determine a candidate route corresponding to a lowest cost one of the calculated travel costs as a travelling route.
9 more elements
Dependencies are inferred from the claim text.