model driven engineering map generation
play

Model Driven Engineering Map Generation Chris Vesters - PowerPoint PPT Presentation

Model Driven Engineering Map Generation Chris Vesters chris.vesters@student.ua.ac.be Contents Design Space Exploration L-System Graph Transformation Simulation Conclusion & Future Work Contents Design Space Exploration L-System


  1. Model Driven Engineering Map Generation Chris Vesters chris.vesters@student.ua.ac.be

  2. Contents Design Space Exploration L-System Graph Transformation Simulation Conclusion & Future Work

  3. Contents Design Space Exploration L-System Graph Transformation Simulation Conclusion & Future Work

  4. Design Space Exploration ◮ Find good / best instance ◮ Steps: 1. Generate a candidate 2. Check the candidate for feasibility 3. Evaluate the candidate 4. Repeat ◮ Several algorithms 1 : ◮ Exhaustive ◮ Random ◮ Hill Climbing 1 Denil, J., Han, G., Persson, M., Liu, X., Zeng, H., Vangheluwe, H., 2013. Model-driven engineering approaches to design space exploration. Tech. rep

  5. Contents Design Space Exploration L-System Graph Transformation Simulation Conclusion & Future Work

  6. L-System: Introduction ◮ Introduced to model plant growth ◮ G = (V, ω , P) ◮ An alphabet V ◮ An initial string ω ◮ A set of rules P ◮ Many extensions

  7. L-System: Example V = 0, 1, [, ], +, - ω = 0 P = { (1 → 11), (0 → 1[-0]+0) }

  8. L-System: Use  M : map growth entity   I : intersection     T : two-way road     O : one-way road  V = [ : store state   ] : restore state     + : angle + 90 ◦     − : angle - 90 ◦  ω = I [+ M ( n )] [ − M ( n )] [+ + M ( n )] M ( n ) � n − x � n − x � n − x  � �� � �� � P 1 : M ( n ) → T ( x ) I + M − M M 3 3 3  P = P 2 : M (0) → ǫ P 3 : T ( x ) → O ( x ) 

  9. L-System: Use Difficulties: ◮ Randomness → Stochastic L-Systems ◮ Analysis → Interpret string

  10. L-System: Use CityGen Engine 2 : 2 Parish, Y. I. H., M¨ uller, P., 2001. Procedural modeling of cities

  11. Contents Design Space Exploration L-System Graph Transformation Simulation Conclusion & Future Work

  12. Graph Transformation: Related Work Riry Pheng 3 : 3 Pheng, R., 2008. Procedural modeling for city map generation - final report

  13. Graph Transformation: Project Meta Model: ToIntersection Multiplicities: - To Intersection: 0 to N Road Intersection - From Road: 0 to N Attributes: Attributes: - length :: Integer - x :: Integer Multiplicities: - y :: Integer - To ToIntersection: 0 to 2 Multiplicities: - From FromIntersection: 0 to 2 - From ToIntersection: 0 to 4 - To FromIntersection: 0 to 4 FromIntersection Multiplicities: - To Road: 0 to N - From Intersection: 0 to N MapInformation Attributes: - remaining :: Integer - size :: Integer

  14. Graph Transformation: Project Rules: ◮ Expand: North, East, South, West ◮ GrowRoad ◮ ConnectIntersections ◮ OneWay

  15. Graph Transformation: Project Feasibility: ◮ Strongly Connected Component Desired Properties: ◮ Road distance close to Manhattan distance ◮ Minimize intersections on trajectory ◮ Cover as much as possible ◮ Roads are evenly distributed ◮ Multiple routes to an intersection Metrics: ◮ Longest path ◮ Average minimal cut

  16. Graph Transformation: Project Space is huge ⇒ algorithm should produce results fast. Algorithm: 1. Select the candidate with the highest score 2. Generate all children 3. Check and evaluate each child ◮ Not feasible or lower score: reject ◮ Higher score: add as candidate 4. Repeat

  17. Graph Transformation: Project Figure: The initial map

  18. Graph Transformation: Project Figure: Iteration 1

  19. Graph Transformation: Project Figure: Iteration 10

  20. Graph Transformation: Project Figure: Iteration 50

  21. Graph Transformation: Project Figure: Iteration 100

  22. Graph Transformation: Project Figure: Iteration 150

  23. Contents Design Space Exploration L-System Graph Transformation Simulation Conclusion & Future Work

  24. Simulation: PyDEVS 4 Model ◮ Cars move from intersection to intersection (trajectory) ◮ Only 1 car at an intersection ◮ Car changes speed when: ◮ Entering a new road ◮ Car before him changes its speed ◮ Reaching end of the road 4 Bolduc, J.-S., Vangheluwe, H., Van Tendeloo, Y., 2000 - 2013. URL http://msdl.cs.mcgill.ca/projects/projects/DEVS/

  25. Contents Design Space Exploration L-System Graph Transformation Simulation Conclusion & Future Work

  26. Conclusion & Future Work Conclusion: ◮ Good metric is most important ◮ Time-expensive Future Work: ◮ Houses, Stores, Offices, ... → Simulation ◮ Multiple lanes, traffic lights, maximum speed ◮ Initially start with Houses, etc and generate road network

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend