Timeline for How should I use Monte Carlo method to simulate some police cars that keep patroling in a tile based map?
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 16, 2020 at 10:15 | history | edited | CommunityBot |
Commonmark migration
|
|
| Dec 2, 2015 at 9:19 | vote | accept | Iman Rosstin | ||
| Nov 25, 2015 at 4:21 | history | tweeted | twitter.com/StackGameDev/status/669370227826774016 | ||
| Nov 18, 2015 at 11:34 | answer | added | Chris | timeline score: 5 | |
| Nov 18, 2015 at 2:31 | review | Close votes | |||
| Nov 25, 2015 at 3:02 | |||||
| Nov 18, 2015 at 2:15 | answer | added | Vaillancourt♦ | timeline score: 4 | |
| Sep 18, 2015 at 9:44 | comment | added | BartekChom | Oh, and maybe if the path finding algorithm treated earlier visited roads as cheaper, the result would be more realistic. Policemen could go the longer way if they had something to do there too. | |
| Sep 18, 2015 at 9:40 | comment | added | BartekChom | I do not see how Monte Carlo method could be useful. Now I think that the police car could go to a place that was visited the longest time ago. If you have n cars, maybe choosing n deepest minima (places that were last visited earlier then all places neighbouring them) instead of n places visited earliest could help avoid the situation when all cars drive together. You could also choose separate territories patrolled by each car. | |
| Sep 18, 2015 at 3:43 | comment | added | Vaillancourt♦ | Your question is clear now. I don't have an answer for you.. at least for now, sorry. | |
| Sep 18, 2015 at 2:53 | comment | added | Iman Rosstin | @AlexandreVaillancourt space filling methods are also another group that could be an answer, like pe'ano not sure how to spell, but it suggest to traverse an area with a single run, no A* or shortest path to reach the destinations is needed. because it is actually the longest route, but I prefer Monte Carlo cause I dont hve to change a lot if codes, implementing a longest path as a patrol route by Pe'ano method could be very hard however I will if I have to. | |
| Sep 18, 2015 at 2:32 | comment | added | Iman Rosstin | @AlexandreVaillancourt I dont know if equal distribution is a right term here,but I need a patrol pattern to distribute my police cars. do you know any? which part you don't understand? | |
| Sep 18, 2015 at 2:29 | history | edited | Iman Rosstin | CC BY-SA 3.0 |
added 282 characters in body
|
| Sep 18, 2015 at 1:10 | history | asked | Iman Rosstin | CC BY-SA 3.0 |