검색어 입력폼

[REVIEW] Adaptive Fastest Path Computation on a Road Network : A Traffic Mining Approach

저작시기 2008.01 |등록일 2008.09.18 파워포인트파일MS 파워포인트 (ppt) | 27페이지 | 가격 2,500원

소개글

Adaptive Fastest Path Computation on a Road Network : A Traffic Mining Approach

목차

Overview
Contribution
Problem Definition
Traffic Database
Road Network Partitioning
Traffic Mining
Pre-computation and Upgrades
Fastest Path Computation
Experimental Evaluation
Conclusion

본문내용

<Contribution>

Road hierarchy-based partitioning
Natural hierarchy to partition the network into semantically meaningful areas
Essential for driving pattern mining and adaptive fastest path pre-computation
Speed rule mining
A set of concise rules
In conditions c for edge e then speed factor = f
Driving pattern mining
Mining frequently traveled edges or edge-sequences
Frequent path-segment at the area level
Adaptive pre-computation
Pre-computing a subset of fastest paths in order to speedup path computation
An area-level pre-computation strategy
Road upgrading
Support for some smaller roads should be upgraded
People usually drive through the largest possible roads available

참고 자료

없음
다운로드 맨위로