Reachability in Scheduling and Planning | phD defense | general audience

29

description

Wat gebeurt er als meerdere objecten door één ruimte bewegen? Gerelateerde wiskundige vragen en algoritmische problemen heb ik onderzocht en opgeschreven in mijn proefschrift. Dit is wat ik gebruikt heb voor de 10 minuten presentatie tijdens mijn verdediging, ook wel het 'lekenpraatje' genoemd.

Transcript of Reachability in Scheduling and Planning | phD defense | general audience

Page 1: Reachability in Scheduling and Planning | phD defense | general audience
Page 2: Reachability in Scheduling and Planning | phD defense | general audience
Page 3: Reachability in Scheduling and Planning | phD defense | general audience

Hoe objecten bewegend in een ruimte elkaar beınvloeden

Page 4: Reachability in Scheduling and Planning | phD defense | general audience
Page 5: Reachability in Scheduling and Planning | phD defense | general audience
Page 6: Reachability in Scheduling and Planning | phD defense | general audience
Page 7: Reachability in Scheduling and Planning | phD defense | general audience
Page 8: Reachability in Scheduling and Planning | phD defense | general audience
Page 9: Reachability in Scheduling and Planning | phD defense | general audience
Page 10: Reachability in Scheduling and Planning | phD defense | general audience
Page 11: Reachability in Scheduling and Planning | phD defense | general audience

N.P. Chapman (1874)

1 2 3 4

5 6 7 8

9 10 11 12

13 14 15

Guarini (1512)

M0M0Z0m0m

Page 12: Reachability in Scheduling and Planning | phD defense | general audience
Page 13: Reachability in Scheduling and Planning | phD defense | general audience
Page 14: Reachability in Scheduling and Planning | phD defense | general audience

Machines TakenA

B

C

D

B A D C

A C D

ACD

A DB

C

Page 15: Reachability in Scheduling and Planning | phD defense | general audience
Page 16: Reachability in Scheduling and Planning | phD defense | general audience

Bereikbaarheidplanning

?

Page 17: Reachability in Scheduling and Planning | phD defense | general audience

Optimale bereikbaarheidplanning

?

Page 18: Reachability in Scheduling and Planning | phD defense | general audience

Computationele complexiteit

makkelijk NP-moeilijksnel

invoer-grootte: ninvoer-grootte:n

Page 19: Reachability in Scheduling and Planning | phD defense | general audience

Computationele complexiteit

makkelijk NP-moeilijk(snel, efficient)

invoer-grootte: ninvoer-grootte:n

Page 20: Reachability in Scheduling and Planning | phD defense | general audience

Computationele complexiteit

makkelijk NP-moeilijk(snel, efficient)

invoer-grootte: ninvoer-grootte:n

Page 21: Reachability in Scheduling and Planning | phD defense | general audience

Computationele complexiteit

makkelijk NP-moeilijk(snel, efficient)

invoer-grootte: naantal stappen ≤ 10n3 − 2n2 + 3

Page 22: Reachability in Scheduling and Planning | phD defense | general audience

Computationele complexiteit

makkelijk NP-moeilijk(snel, efficient)

invoer-grootte: naantal stappen ≤ 10n3 − 2n2 + 3

Page 23: Reachability in Scheduling and Planning | phD defense | general audience

Optimale bereikbaarheidplanning

makkelijk

Page 24: Reachability in Scheduling and Planning | phD defense | general audience

Optimale bereikbaarheidplanning

NP-moeilijk

Page 25: Reachability in Scheduling and Planning | phD defense | general audience

Scheduling

AB

C

D

Page 26: Reachability in Scheduling and Planning | phD defense | general audience

Scheduling

AB

C

D

C

Page 27: Reachability in Scheduling and Planning | phD defense | general audience

Scheduling

1. Veilig?2. Bereikbaar?3. Deadlock bereikbaar?

AB

C

D

C

Page 28: Reachability in Scheduling and Planning | phD defense | general audience

Veilig?Scheduling

Makkelijk indien machines met capaciteit 1 enkel voorkomen intaken van de linkerkant, anders NP-moeilijk

.... . .

Page 29: Reachability in Scheduling and Planning | phD defense | general audience