2 registered members (Akow, tomaslolo),
1,536
guests, and 12
spiders. |
Key:
Admin,
Global Mod,
Mod
|
|
|
Re: Dijkstra and Wed paths
[Re: NITRO777]
#216017
07/14/08 16:53
07/14/08 16:53
|
Joined: Jun 2005
Posts: 87 France
MadJack
OP
Junior Member
|
OP
Junior Member
Joined: Jun 2005
Posts: 87
France
|
It's hard to say ! It depends on your project. I have to do it for my own project, and it it's not so easy. So far I guess that the main action will follow some steps like : - Evaluate my state of mind
- Take a decision
- If decision need a new displacement :
- see where I am (PtDep) - say where I want to go (PtDest) - If I am moving to PtDest : follow the path untill PtDest
- If I am where I want : do something
and so on... Meanwhile, you'll have to analyse the world to change the feelings of your character, enable avoidance... Might be very complicated. This is the reason why I have called my project "RUGod"
|
|
|
Re: Dijkstra and Wed paths
[Re: MadJack]
#216366
07/16/08 18:51
07/16/08 18:51
|
Joined: Jun 2005
Posts: 87 France
MadJack
OP
Junior Member
|
OP
Junior Member
Joined: Jun 2005
Posts: 87
France
|
May be less tha n a week... Here is a beta demo level using wed paths and Dijkstra algo. Demo MDJK There is nothing to do. Just look at it (like a screensaver). Camera will follow the chief. The chief try to reach the yellow mark. When he get it, the mark goes to another node. N.B.: Due to very short avoidance script, sometimes guard might fall down ...
|
|
|
Re: Dijkstra and Wed paths
[Re: NITRO777]
#216404
07/16/08 21:46
07/16/08 21:46
|
Joined: Oct 2007
Posts: 5,210 İstanbul, Turkey
Quad
Senior Expert
|
Senior Expert
Joined: Oct 2007
Posts: 5,210
İstanbul, Turkey
|
really cool.
i some dll there? all open source lite-c or you will release a DLL plugin?
3333333333
|
|
|
Re: Dijkstra and Wed paths
[Re: Quad]
#216484
07/17/08 09:44
07/17/08 09:44
|
Joined: Jun 2005
Posts: 87 France
MadJack
OP
Junior Member
|
OP
Junior Member
Joined: Jun 2005
Posts: 87
France
|
Merci ! Before releasing my code, I want to clean it and to add some comments. So far, it's not clear enough... Here is a top wiew of the level : What is interesting is that we have here 12 guards using the same path at the same time. Path has about 65 nodes. You can see that path calculation is very fast. Avoidance is very short code, you 'll see that soon (1 or 2 days). For tests purpose, I let a bloc on the way (bottom left quarter) Funny to see how the guards avoid it !
|
|
|
Re: Dijkstra and Wed paths
[Re: MadJack]
#216528
07/17/08 12:29
07/17/08 12:29
|
Joined: Mar 2003
Posts: 3,010 analysis paralysis
NITRO777
Expert
|
Expert
Joined: Mar 2003
Posts: 3,010
analysis paralysis
|
What is interesting is that we have here 12 guards using the same path at the same time. Wow! I have been trying to do this also but have only barely succeeded, for all my efforts I have only been able to fix one guard per action, this is much better. I am looking forward to seeing this code. A big 'merci' to you also!
|
|
|
Re: Dijkstra and Wed paths
[Re: Machinery_Frank]
#216620
07/17/08 21:32
07/17/08 21:32
|
Joined: Jun 2005
Posts: 87 France
MadJack
OP
Junior Member
|
OP
Junior Member
Joined: Jun 2005
Posts: 87
France
|
Thanks, So, here is my full folder with DLL, sources and published folder. Released "as it" Full Demo V0.6 (8 Mo) It is still a beta version of the DLL. Now I'd like to doublecheck the memory management and add other functions. Have fun !
|
|
|
|