Jump to content

  • Log In with Google      Sign In   
  • Create Account


ater1980

Member Since 09 Apr 2012
Offline Last Active May 27 2012 07:57 PM
-----

Posts I've Made

In Topic: Penalized/Constrained Distance Function

11 April 2012 - 04:02 AM

You should probably start with A*.


Ok thanks. Does it work if enemies perform eandom walk on the grid?

In Topic: Penalized/Constrained Distance Function

11 April 2012 - 01:24 AM

I'm really honestly puzzled as to why you're using an evolutionary algorithm for pathing, when pathing is a very well understood problem with a number of extremely good solutions.

It kind of strikes me as similar to using a sandwich to hammer in nails. If you're incredibly patient and have really cooperative nails, you might get somewhere before you die of old age... but it seems to me like you should trade the sandwich for a hammer and just get the job done.


Can you suggest some articles or manuals on this topic? I really have never done this before.

In Topic: Penalized/Constrained Distance Function

10 April 2012 - 05:04 AM

@Apoch: I thought of mentioning influence maps, but they seem much less useful when using the "pick x random locations" approach to navigation as opposed to A*. Calculating the influence map would dwarf selecting a location if you only consider a handful of locations each frame and enemies can move.

I do definitely agree that enemy influence needs to drop off. Many functions that are asymptotic to zero would be fine, because otherwise the weights of a few enemies anywhere on the map could totally overwhelm the goal-seeking behaviour.

Lastly I would suggest reconsidering using a better pathfinding method unless there's a good reason. Imagine this scenario:
- Goal G is at (0,0).
- Enemy E1 is at (50,0).
- Enemy E2 is at (0,50).
- Player P is at (50,50).

For values of c >= 0.5, P will almost never reach G, instead being repelled by E1 and E2. In fact the same applies if P starts anywhere on the map outside the triangle G, E1, E2. You may think that tweaking the value of c will fix the problem, but if you keep adding enemies it will break again.


what you say makes sense, but honestly it's not my impression: for c<1 P pretty much ignores enemies regardless of the distance to them(or so far I haven't noticed much strategy in the trajectory), but for c>1 it just stays in one spot for a long time scared to death by them. I'm quite sure there should be some systematic way people design these ditance functions.

In Topic: Penalized/Constrained Distance Function

10 April 2012 - 03:44 AM

I have to ask... why generate candidates randomly? It's an unusual approach to pathfinding.


Simple evolutionary algorithm. A number of candiate solutions are generated base on the current one. Next step is to attach a fitness/objective function to each of them and then derive probability distribution. The second step is a clincher for me since I don't know how to do find this fitness function. Currently I'm just using d1-c*d2, which I guess is a pretty rough way of doing it.

PARTNERS