Timeline for Finding the nearest object, considering obstacles
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 22, 2014 at 15:52 | comment | added | House | See the cheap way | |
| Feb 22, 2014 at 15:51 | history | edited | House | CC BY-SA 3.0 | edited body; edited title |
| Feb 22, 2014 at 14:39 | vote | accept | Moo-Juice | ||
| Feb 22, 2014 at 13:30 | answer | added | user39686 | timeline score: 1 | |
| Feb 22, 2014 at 13:23 | answer | added | Lighthink | timeline score: 1 | |
| Feb 22, 2014 at 13:20 | comment | added | MickLH | ^ This comment nails it so hard. What have you tried? | |
| Feb 22, 2014 at 13:09 | comment | added | Vaillancourt♦ | Also, if your janitor has to go from his actual location to the trash in situation (1), he'll know which trash is the closest, but, based on that, he'll try to go through the wall? How will he know the path he'll have to follow to get to that thrash? From your question, you'll still have to implement a path-finding algorithm anyways. | |
| Feb 22, 2014 at 13:08 | comment | added | Vaillancourt♦ | You actual question is really opinion based, and really depends on the context. Having a janitor actually search for trash is not quite the same thing as a janitor who just walk around and pick up trash. It's a totally different behaviour. | |
| Feb 22, 2014 at 12:53 | history | asked | Moo-Juice | CC BY-SA 3.0 |