Model Driven Engineering Map Generation Chris Vesters - - PowerPoint PPT Presentation

▶
model driven engineering map generation
SMART_READER_LITE
LIVE PREVIEW

Model Driven Engineering Map Generation Chris Vesters - - PowerPoint PPT Presentation

Nov 20, 2022 571 likes •869 views

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

slide-1
SLIDE 1

Model Driven Engineering Map Generation

Chris Vesters chris.vesters@student.ua.ac.be

slide-2
SLIDE 2

Contents

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

slide-3
SLIDE 3

Contents

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

slide-4
SLIDE 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

1Denil, J., Han, G., Persson, M., Liu, X., Zeng, H., Vangheluwe, H.,

  • 2013. Model-driven engineering approaches to design space exploration.
  • Tech. rep
slide-5
SLIDE 5

Contents

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

slide-6
SLIDE 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

slide-7
SLIDE 7

L-System: Example

V = 0, 1, [, ], +, - ω = 0 P = {(1 → 11), (0 → 1[-0]+0)}

slide-8
SLIDE 8

L-System: Use

V =                        M : map growth entity I : intersection T : two-way road O :

  • ne-way road

[ : store state ] : restore state + : angle + 90◦ − : angle - 90◦ ω = I [+M (n)] [−M (n)] [+ + M (n)] M (n) P =    P1 : M (n) → T (x) I

  • +M

n−x

3

−M n−x

3

  • M

n−x

3

  • P2 :

M(0) → ǫ P3 : T(x) → O(x)

slide-9
SLIDE 9

L-System: Use

Difficulties:

◮ Randomness → Stochastic L-Systems ◮ Analysis → Interpret string

slide-10
SLIDE 10

L-System: Use

CityGen Engine 2:

2Parish, Y. I. H., M¨

uller, P., 2001. Procedural modeling of cities

slide-11
SLIDE 11

Contents

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

slide-12
SLIDE 12

Graph Transformation: Related Work

Riry Pheng 3:

3Pheng, R., 2008. Procedural modeling for city map generation - final

report

slide-13
SLIDE 13

Graph Transformation: Project

Meta Model:

Attributes:

  • length :: Integer

Multiplicities:

  • To ToIntersection: 0 to 2
  • From FromIntersection: 0 to 2

Road Attributes:

  • x :: Integer
  • y :: Integer

Multiplicities:

  • From ToIntersection: 0 to 4
  • To FromIntersection: 0 to 4

Intersection Attributes:

  • remaining :: Integer
  • size :: Integer

MapInformation ToIntersection Multiplicities:

  • To Intersection: 0 to N
  • From Road: 0 to N

FromIntersection Multiplicities:

  • To Road: 0 to N
  • From Intersection: 0 to N
slide-14
SLIDE 14

Graph Transformation: Project

Rules:

◮ Expand: North, East, South, West ◮ GrowRoad ◮ ConnectIntersections ◮ OneWay

slide-15
SLIDE 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

slide-16
SLIDE 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
slide-17
SLIDE 17

Graph Transformation: Project

Figure: The initial map

slide-18
SLIDE 18

Graph Transformation: Project

Figure: Iteration 1

slide-19
SLIDE 19

Graph Transformation: Project

Figure: Iteration 10

slide-20
SLIDE 20

Graph Transformation: Project

Figure: Iteration 50

slide-21
SLIDE 21

Graph Transformation: Project

Figure: Iteration 100

slide-22
SLIDE 22

Graph Transformation: Project

Figure: Iteration 150

slide-23
SLIDE 23

Contents

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

slide-24
SLIDE 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

4Bolduc, J.-S., Vangheluwe, H., Van Tendeloo, Y., 2000 - 2013.

URL http://msdl.cs.mcgill.ca/projects/projects/DEVS/

slide-25
SLIDE 25

Contents

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

slide-26
SLIDE 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

slide-27
SLIDE 27