IPC분류정보
국가/구분 |
United States(US) Patent
등록
|
국제특허분류(IPC7판) |
|
출원번호 |
US-0423748
(2003-04-25)
|
발명자
/ 주소 |
- Beesley, Darin J.
- Childs, Michael
|
출원인 / 주소 |
|
대리인 / 주소 |
|
인용정보 |
피인용 횟수 :
33 인용 특허 :
8 |
초록
▼
A method and apparatus are provided for calculating potential paths through a roadway network defined at least partially by separate, but adjacent data maps. First and second data maps are provided that are indicative of roadway networks for different geographic regions bounded by region edges, at l
A method and apparatus are provided for calculating potential paths through a roadway network defined at least partially by separate, but adjacent data maps. First and second data maps are provided that are indicative of roadway networks for different geographic regions bounded by region edges, at least one of which is common to both geographic regions. The data maps are adjacent, and one data map contains the first location while the other data map contains a roadway segment over which the potential paths may travel. Potential paths are planned from the first location through the first data map. When a current potential path intersects an edge of the first data map, the intersection is identified by coordinate data. A transition point is located in an adjacent data map based on the location where the current potential path intersects the edge of the firs data map. The calculation method and apparatus continue from the transition point through the second data map toward the second location.
대표청구항
▼
A method and apparatus are provided for calculating potential paths through a roadway network defined at least partially by separate, but adjacent data maps. First and second data maps are provided that are indicative of roadway networks for different geographic regions bounded by region edges, at l
A method and apparatus are provided for calculating potential paths through a roadway network defined at least partially by separate, but adjacent data maps. First and second data maps are provided that are indicative of roadway networks for different geographic regions bounded by region edges, at least one of which is common to both geographic regions. The data maps are adjacent, and one data map contains the first location while the other data map contains a roadway segment over which the potential paths may travel. Potential paths are planned from the first location through the first data map. When a current potential path intersects an edge of the first data map, the intersection is identified by coordinate data. A transition point is located in an adjacent data map based on the location where the current potential path intersects the edge of the firs data map. The calculation method and apparatus continue from the transition point through the second data map toward the second location. 4/715.06; US-5074947, 19911200, Estes et al., 156/307.3; US-5075940, 19911200, Kuriyama et al., 029/025.03; US-5162787, 19921100, Thompson et al., 340/794; US-5164019, 19921100, Sinton, 136/249; US-5165013, 19921100, Faris, 395/104; US-5168401, 19921200, Endriz, 359/625; US-5168406, 19921200, Nelson, 359/855; US-5170156, 19921200, DeMond et al., 340/794; US-5170269, 19921200, Lin et al., 359/009; US-5170283, 19921200, O'Brien et al., 359/291; US-5172161, 19921200, Nelson, 355/200; US-5172262, 19921200, Hornbeck, 359/223; US-5177724, 19930100, Gelbart, 369/044.16; US-5178728, 19930100, Boysel et al., 156/656; US-5179274, 19930100, Sampsell, 250/208.2; US-5179367, 19930100, Shimizu, 340/700; US-5181231, 19930100, Parikh et al., 377/026; US-5182665, 19930100, O'Callaghan et al., 359/095; US-5185660, 19930200, Um, 358/060; US-5188280, 19930200, Nakao et al., 228/123; US-5189404, 19930200, Masimo et al., 340/720; US-5189505, 19930200, Bartelink, 257/419; US-5191405, 19930300, Tomita et al., 257/777; US-5192864, 19930300, McEwen et al., 250/234; US-5192946, 19930300, Thompson et al., 340/794; US-5198895, 19930300, Vick, 358/103; US-
※ AI-Helper는 부적절한 답변을 할 수 있습니다.