IPC분류정보
국가/구분 |
United States(US) Patent
등록
|
국제특허분류(IPC7판) |
|
출원번호 |
US-0227095
(2011-09-07)
|
등록번호 |
US-8762050
(2014-06-24)
|
발명자
/ 주소 |
- Chen, Wen-Tsuen
- Chen, Po-Yu
- Guo, Yi-Min
|
출원인 / 주소 |
- National Tsing Hua University
|
대리인 / 주소 |
|
인용정보 |
피인용 횟수 :
0 인용 특허 :
4 |
초록
▼
A fuel-saving path planning navigation system and a fuel-saving path planning method thereof. A plurality of sensors monitors a plurality of roads respectively and periodically report traffic information to a server. The server comprises a storing module and a processing module. The storing module s
A fuel-saving path planning navigation system and a fuel-saving path planning method thereof. A plurality of sensors monitors a plurality of roads respectively and periodically report traffic information to a server. The server comprises a storing module and a processing module. The storing module stores the traffic information as history information. The processing module estimates how many vehicles on a road based upon the history information, calculates fuel consumption of each possible planned path including current fuel consumption based on real-time traffic and future fuel consumption based on the historical information, and plans a most fuel-efficient path. Also, the processing module recalculates fuel consumption of remaining path and changes the remaining path while fuel cost of a new path better 10% than the remaining path.
대표청구항
▼
1. A fuel-saving path planning navigation system, comprising: a plurality of sensors monitoring a plurality of roads respectively and periodically reporting traffic information to a server, wherein the plurality of sensors detect average speed of vehicles on the plurality of roads, and the plurality
1. A fuel-saving path planning navigation system, comprising: a plurality of sensors monitoring a plurality of roads respectively and periodically reporting traffic information to a server, wherein the plurality of sensors detect average speed of vehicles on the plurality of roads, and the plurality of sensors report the traffic information with different cycles according to peak and off-peak periods; in the peak period, a first detection cycle is assigned to the plurality of sensors; in the off-peak period, a second detection cycle, which is longer than the first detection cycle, is assigned to the plurality of sensors;the server comprising: a storing module storing the traffic information as history information, which includes the average speed of vehicles;a processing module estimating how many vehicles on one of the plurality of roads based upon the history information, calculating fuel consumption of each possible planned path including current fuel consumption based on real-time traffic and future fuel consumption based on the historical information, and planning a most fuel-efficient path based on a following relation: Fx=ρ×Fx,N+(1−ρ)×Fx,H;wherein Fx is a fuel consumption of a road x, ρ is a real number between 0 and 1, Fx,N is a real time fuel consumption of the road x, and Fx, His a fuel consumption from the history information of the road x;wherein the processing module further determines whether to planning a new most fuel-efficient path based on the real-time traffic while driving on the most fuel-efficient path; wherein the most fuel-efficient path is kept if the fuel consumption of the new most fuel-efficient path is not 10% better than the most fuel-efficient path. 2. The fuel-saving path planning navigation system as claimed in claim 1, wherein the sensors keep monitoring and reporting the traffic information to the server, and the processing module recalculates fuel consumption of remaining path and changes the remaining path while fuel cost of a new path better 10% than the remaining path. 3. The fuel-saving path planning navigation system as claimed in claim 1, wherein the traffic information includes a section identity, a velocity of the road x and a reporting time. 4. The fuel-saving path planning navigation system as claimed in claim 1, wherein the processing module estimating how many vehicles on a road further based upon a traffic flow theory and a following relation is satisfied: D=C×ebVx;wherein D is car density of the road x, Vx is an average velocity of the road x, and C and b are variables related to the history information. 5. The fuel-saving path planning navigation system as claimed in claim 4, wherein the processing module further calculates fuel cost based on a fuel cost function and a following relation of the fuel cost function is satisfied: F(Vx)=a×(1b2Vx2-1b+c);wherein Vx is an average velocity of the road x, and a, b and c are vehicular parameters. 6. The fuel-saving path planning navigation system as claimed in claim 5, wherein the processing module further computes a weighted number of vehicles Kx and a following relation is satisfied: Kx=∑t=Tp/It+Tr(H[t]×ⅇ-(t-TpI));wherein Tp is how much time to arrive at the road x and Tp is a weighted range of the history information. 7. The fuel-saving path planning navigation system as claimed in claim 6, wherein the processing module further uses Kx to calculate a speed of the road x and Lx is a length of the road x and a following relation is satisfied: Vx,H=1b×logKxC×Lx. 8. The fuel-saving path planning navigation system as claimed in claim 7, wherein the processing module further uses Vx,H to calculate the future fuel consumption of the road x at a time t and Lx is the length of the road x and a following relation is satisfied: Fx,H=F(Vx,H)×LxVx,H. 9. A fuel-saving path planning method, comprising following steps: monitoring a plurality of roads respectively and periodically reporting traffic information to a server by a plurality of sensors, wherein the plurality of sensors detect average speed of vehicles on the plurality of roads, and the plurality of sensors report the traffic information with different cycles according to peak and off-peak periods; in the peak period, a first detection cycle is assigned to the plurality of sensors; in the off-peak period, a second detection cycle, which is longer than the first detection cycle, is assigned to the plurality of sensors;storing the traffic information as history information, which includes the average speed of vehicles, to a storing module;estimating how many vehicles on one of the plurality of roads based upon the history information by a processing module;calculating fuel consumption of each possible planned path including current fuel consumption based on real-time traffic and future fuel consumption based on the historical information by the processing module; andplanning a most fuel-efficient path by the processing module based on a following relation: Fx=ρ×Fx,N+(1−ρ)×Fx,H;wherein Fx is a fuel consumption of a road x, ρ is a real number between 0 and 1, Fx,N is a real time fuel consumption of the road x, and Fx, H is a fuel consumption from the history information of the road x;determining whether to planning a new most fuel-efficient path based on the real-time traffic while driving on the most fuel-efficient path, wherein the most fuel-efficient path is kept if the fuel consumption of the new most fuel-efficient path is not 10% better than the most fuel-efficient path. 10. The fuel-saving path planning method as claimed in claim 9, further comprising the following step: using the sensors to keep monitoring and reporting the traffic information to the server; andrecalculating fuel consumption of remaining path and changing the remaining path by the processing module while fuel cost of a new path better 10% than the remaining path. 11. The fuel-saving path planning method as claimed in claim 9, wherein the traffic information includes a section identity, a velocity of the road x and a reporting time. 12. The fuel-saving path planning method as claimed in claim 9, wherein the processing module estimates how many vehicles on a road further based upon a traffic flow theory and a following relation is satisfied: D=C×ebVx;wherein D is car density of the road x, Vx is an average velocity of the road x, and C and b are variables related to the history information. 13. The fuel-saving path planning method as claimed in claim 12, wherein the processing module further calculates fuel cost based on a fuel function and a following relation of the fuel cost function is satisfied: F(Vx)=a×(1b2Vx2-1b+c);wherein Vx is an average velocity of the road x, and a, b and c are vehicular parameters. 14. The fuel-saving path planning method as claimed in claim 13, wherein the processing module further computes a weighted number of vehicles Kx and a following relation is satisfied: Kx=∑t=Tp/It+Tr(H[t]×ⅇ-(t-TpI));wherein Tp is how much time to arrive at the road x and Tp is a weighted range of the history information. 15. The fuel-saving path planning method as claimed in claim 14, wherein the processing module further uses Kx to calculate a speed of the road x and Lx is a length of the road x and a following relation is satisfied: Vx,H=1b×logKxC×Lx. 16. The fuel-saving path planning method as claimed in claim 15, wherein the processing module further uses Vx,H to calculate the future fuel consumption of the road x at a time t and Lx is the length of the road x and a following relation is satisfied: Fx,H=F(Vx,H)×LxVx,H.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.