1 #include "navigation.qh"
6 #include "waypoints.qh"
8 #include <common/t_items.qh>
10 #include <common/items/_mod.qh>
12 #include <common/constants.qh>
13 #include <common/net_linked.qh>
14 #include <common/triggers/trigger/jumppads.qh>
18 void navigation_dynamicgoal_init(entity this, bool initially_static)
20 this.navigation_dynamicgoal = true;
21 this.bot_basewaypoint = this.nearestwaypoint;
23 this.nearestwaypointtimeout = -1;
25 this.nearestwaypointtimeout = time;
28 void navigation_dynamicgoal_set(entity this)
30 this.nearestwaypointtimeout = time;
33 void navigation_dynamicgoal_unset(entity this)
35 if(this.bot_basewaypoint)
36 this.nearestwaypoint = this.bot_basewaypoint;
37 this.nearestwaypointtimeout = -1;
40 // rough simulation of walking from one point to another to test if a path
41 // can be traveled, used for waypoint linking and havocbot
43 bool tracewalk(entity e, vector start, vector m1, vector m2, vector end, float movemode)
54 if(autocvar_bot_debug_tracewalk)
63 dist = totaldist = vlen(move);
64 dir = normalize(move);
66 ignorehazards = false;
69 // Analyze starting point
70 traceline(start, start, MOVE_NORMAL, e);
71 if (trace_dpstartcontents & (DPCONTENTS_SLIME | DPCONTENTS_LAVA))
75 traceline( start, start + '0 0 -65536', MOVE_NORMAL, e);
76 if (trace_dpstartcontents & (DPCONTENTS_SLIME | DPCONTENTS_LAVA))
82 tracebox(start, m1, m2, start, MOVE_NOMONSTERS, e);
86 if(autocvar_bot_debug_tracewalk)
87 debugnodestatus(start, DEBUG_NODE_FAIL);
89 //print("tracewalk: ", vtos(start), " is a bad start\n");
97 if (boxesoverlap(end, end, org + m1 + '-1 -1 -1', org + m2 + '1 1 1'))
100 if(autocvar_bot_debug_tracewalk)
101 debugnodestatus(org, DEBUG_NODE_SUCCESS);
103 //print("tracewalk: ", vtos(start), " can reach ", vtos(end), "\n");
106 if(autocvar_bot_debug_tracewalk)
113 dist = dist - stepdist;
114 traceline(org, org, MOVE_NORMAL, e);
117 if (trace_dpstartcontents & (DPCONTENTS_SLIME | DPCONTENTS_LAVA))
119 // hazards blocking path
120 if(autocvar_bot_debug_tracewalk)
121 debugnodestatus(org, DEBUG_NODE_FAIL);
123 //print("tracewalk: ", vtos(start), " hits a hazard when trying to reach ", vtos(end), "\n");
127 if (trace_dpstartcontents & DPCONTENTS_LIQUIDSMASK)
129 move = normalize(end - org);
130 tracebox(org, m1, m2, org + move * stepdist, movemode, e);
132 if(autocvar_bot_debug_tracewalk)
133 debugnode(e, trace_endpos);
135 if (trace_fraction < 1)
138 org = trace_endpos + normalize(org - trace_endpos) * stepdist;
139 for (; org.z < end.z + e.maxs.z; org.z += stepdist)
141 if(autocvar_bot_debug_tracewalk)
144 if(pointcontents(org) == CONTENT_EMPTY)
148 if(pointcontents(org + '0 0 1') != CONTENT_EMPTY)
150 if(autocvar_bot_debug_tracewalk)
151 debugnodestatus(org, DEBUG_NODE_FAIL);
154 //print("tracewalk: ", vtos(start), " failed under water\n");
164 move = dir * stepdist + org;
165 tracebox(org, m1, m2, move, movemode, e);
167 if(autocvar_bot_debug_tracewalk)
168 debugnode(e, trace_endpos);
171 if (trace_fraction < 1)
173 // check if we can walk over this obstacle, possibly by jumpstepping
174 tracebox(org + stepheightvec, m1, m2, move + stepheightvec, movemode, e);
175 if (trace_fraction < 1 || trace_startsolid)
177 tracebox(org + jumpstepheightvec, m1, m2, move + jumpstepheightvec, movemode, e);
178 if (trace_fraction < 1 || trace_startsolid)
180 bool ladder_found = false;
181 FOREACH_ENTITY_CLASS("func_ladder", boxesoverlap(trace_endpos + m1 + '-1 -1 -1', trace_endpos + m2 + '1 1 1', it.absmin, it.absmax),
183 if(boxesoverlap(end, end, it.absmin + (m1 - eZ * m1.z - '1 1 0'), it.absmax + (m2 - eZ * m2.z + '1 1 0')))
184 ladder_found = true; // can't return here ("Loop mutex held by tracewalk" error)
188 if(autocvar_bot_debug_tracewalk)
189 debugnodestatus(org, DEBUG_NODE_SUCCESS);
191 //print("tracewalk: ", vtos(start), " can reach ", vtos(end), "\n");
195 if(autocvar_bot_debug_tracewalk)
196 debugnodestatus(trace_endpos, DEBUG_NODE_WARNING);
198 traceline( org, move, movemode, e);
200 if ( trace_ent.classname == "door_rotating" || trace_ent.classname == "door")
204 while(trace_ent.classname == "door_rotating" || trace_ent.classname == "door")
206 nextmove = move + (dir * stepdist);
207 traceline( move, nextmove, movemode, e);
213 if(autocvar_bot_debug_tracewalk)
214 debugnodestatus(trace_endpos, DEBUG_NODE_FAIL);
216 //print("tracewalk: ", vtos(start), " hit something when trying to reach ", vtos(end), "\n");
217 //te_explosion(trace_endpos);
218 //print(ftos(e.dphitcontentsmask), "\n");
219 return false; // failed
231 // trace down from stepheight as far as possible and move there,
232 // if this starts in solid we try again without the stepup, and
233 // if that also fails we assume it is a wall
234 // (this is the same logic as the Quake walkmove function used)
235 tracebox(move, m1, m2, move + '0 0 -65536', movemode, e);
237 // moved successfully
241 c = pointcontents(org + '0 0 1');
242 if (!(c == CONTENT_WATER || c == CONTENT_LAVA || c == CONTENT_SLIME))
252 //print("tracewalk: ", vtos(start), " did not arrive at ", vtos(end), " but at ", vtos(org), "\n");
254 // moved but didn't arrive at the intended destination
255 if(autocvar_bot_debug_tracewalk)
256 debugnodestatus(org, DEBUG_NODE_FAIL);
261 /////////////////////////////////////////////////////////////////////////////
263 /////////////////////////////////////////////////////////////////////////////
265 // completely empty the goal stack, used when deciding where to go
266 void navigation_clearroute(entity this)
268 //print("bot ", etos(this), " clear\n");
269 this.goalentity = NULL;
270 this.goalcurrent = NULL;
271 this.goalstack01 = NULL;
272 this.goalstack02 = NULL;
273 this.goalstack03 = NULL;
274 this.goalstack04 = NULL;
275 this.goalstack05 = NULL;
276 this.goalstack06 = NULL;
277 this.goalstack07 = NULL;
278 this.goalstack08 = NULL;
279 this.goalstack09 = NULL;
280 this.goalstack10 = NULL;
281 this.goalstack11 = NULL;
282 this.goalstack12 = NULL;
283 this.goalstack13 = NULL;
284 this.goalstack14 = NULL;
285 this.goalstack15 = NULL;
286 this.goalstack16 = NULL;
287 this.goalstack17 = NULL;
288 this.goalstack18 = NULL;
289 this.goalstack19 = NULL;
290 this.goalstack20 = NULL;
291 this.goalstack21 = NULL;
292 this.goalstack22 = NULL;
293 this.goalstack23 = NULL;
294 this.goalstack24 = NULL;
295 this.goalstack25 = NULL;
296 this.goalstack26 = NULL;
297 this.goalstack27 = NULL;
298 this.goalstack28 = NULL;
299 this.goalstack29 = NULL;
300 this.goalstack30 = NULL;
301 this.goalstack31 = NULL;
304 // add a new goal at the beginning of the stack
305 // (in other words: add a new prerequisite before going to the later goals)
306 // NOTE: when a waypoint is added, the WP gets pushed first, then the
307 // next-closest WP on the shortest path to the WP
308 // That means, if the stack overflows, the bot will know how to do the FIRST 32
309 // steps to the goal, and then recalculate the path.
310 void navigation_pushroute(entity this, entity e)
312 //print("bot ", etos(this), " push ", etos(e), "\n");
313 if(this.goalstack31 == this.goalentity)
314 this.goalentity = NULL;
315 this.goalstack31 = this.goalstack30;
316 this.goalstack30 = this.goalstack29;
317 this.goalstack29 = this.goalstack28;
318 this.goalstack28 = this.goalstack27;
319 this.goalstack27 = this.goalstack26;
320 this.goalstack26 = this.goalstack25;
321 this.goalstack25 = this.goalstack24;
322 this.goalstack24 = this.goalstack23;
323 this.goalstack23 = this.goalstack22;
324 this.goalstack22 = this.goalstack21;
325 this.goalstack21 = this.goalstack20;
326 this.goalstack20 = this.goalstack19;
327 this.goalstack19 = this.goalstack18;
328 this.goalstack18 = this.goalstack17;
329 this.goalstack17 = this.goalstack16;
330 this.goalstack16 = this.goalstack15;
331 this.goalstack15 = this.goalstack14;
332 this.goalstack14 = this.goalstack13;
333 this.goalstack13 = this.goalstack12;
334 this.goalstack12 = this.goalstack11;
335 this.goalstack11 = this.goalstack10;
336 this.goalstack10 = this.goalstack09;
337 this.goalstack09 = this.goalstack08;
338 this.goalstack08 = this.goalstack07;
339 this.goalstack07 = this.goalstack06;
340 this.goalstack06 = this.goalstack05;
341 this.goalstack05 = this.goalstack04;
342 this.goalstack04 = this.goalstack03;
343 this.goalstack03 = this.goalstack02;
344 this.goalstack02 = this.goalstack01;
345 this.goalstack01 = this.goalcurrent;
346 this.goalcurrent = e;
349 // remove first goal from stack
350 // (in other words: remove a prerequisite for reaching the later goals)
351 // (used when a spawnfunc_waypoint is reached)
352 void navigation_poproute(entity this)
354 //print("bot ", etos(this), " pop\n");
355 if(this.goalcurrent == this.goalentity)
356 this.goalentity = NULL;
357 this.goalcurrent = this.goalstack01;
358 this.goalstack01 = this.goalstack02;
359 this.goalstack02 = this.goalstack03;
360 this.goalstack03 = this.goalstack04;
361 this.goalstack04 = this.goalstack05;
362 this.goalstack05 = this.goalstack06;
363 this.goalstack06 = this.goalstack07;
364 this.goalstack07 = this.goalstack08;
365 this.goalstack08 = this.goalstack09;
366 this.goalstack09 = this.goalstack10;
367 this.goalstack10 = this.goalstack11;
368 this.goalstack11 = this.goalstack12;
369 this.goalstack12 = this.goalstack13;
370 this.goalstack13 = this.goalstack14;
371 this.goalstack14 = this.goalstack15;
372 this.goalstack15 = this.goalstack16;
373 this.goalstack16 = this.goalstack17;
374 this.goalstack17 = this.goalstack18;
375 this.goalstack18 = this.goalstack19;
376 this.goalstack19 = this.goalstack20;
377 this.goalstack20 = this.goalstack21;
378 this.goalstack21 = this.goalstack22;
379 this.goalstack22 = this.goalstack23;
380 this.goalstack23 = this.goalstack24;
381 this.goalstack24 = this.goalstack25;
382 this.goalstack25 = this.goalstack26;
383 this.goalstack26 = this.goalstack27;
384 this.goalstack27 = this.goalstack28;
385 this.goalstack28 = this.goalstack29;
386 this.goalstack29 = this.goalstack30;
387 this.goalstack30 = this.goalstack31;
388 this.goalstack31 = NULL;
391 float navigation_waypoint_will_link(vector v, vector org, entity ent, float walkfromwp, float bestdist)
394 dist = vlen(v - org);
397 traceline(v, org, true, ent);
398 if (trace_fraction == 1)
402 if (tracewalk(ent, v, PL_MIN_CONST, PL_MAX_CONST, org, bot_navigation_movemode))
407 if (tracewalk(ent, org, PL_MIN_CONST, PL_MAX_CONST, v, bot_navigation_movemode))
415 // find the spawnfunc_waypoint near a dynamic goal such as a dropped weapon
416 entity navigation_findnearestwaypoint_withdist_except(entity ent, float walkfromwp, float bestdist, entity except)
418 vector pm1 = ent.origin + ent.mins;
419 vector pm2 = ent.origin + ent.maxs;
421 // do two scans, because box test is cheaper
422 IL_EACH(g_waypoints, it != ent && it != except,
424 if(boxesoverlap(pm1, pm2, it.absmin, it.absmax))
428 vector org = ent.origin + 0.5 * (ent.mins + ent.maxs);
429 org.z = ent.origin.z + ent.mins.z - PL_MIN_CONST.z; // player height
430 // TODO possibly make other code have the same support for bboxes
432 org = org + ent.tag_entity.origin;
433 if (navigation_testtracewalk)
439 // box check failed, try walk
440 IL_EACH(g_waypoints, it != ent,
444 vector wm1 = it.origin + it.mins;
445 vector wm2 = it.origin + it.maxs;
446 v.x = bound(wm1_x, org.x, wm2_x);
447 v.y = bound(wm1_y, org.y, wm2_y);
448 v.z = bound(wm1_z, org.z, wm2_z);
452 if(navigation_waypoint_will_link(v, org, ent, walkfromwp, bestdist))
454 bestdist = vlen(v - org);
460 entity navigation_findnearestwaypoint(entity ent, float walkfromwp)
462 entity wp = navigation_findnearestwaypoint_withdist_except(ent, walkfromwp, 1050, NULL);
463 if (autocvar_g_waypointeditor_auto)
465 entity wp2 = navigation_findnearestwaypoint_withdist_except(ent, walkfromwp, 1050, wp);
467 wp.wpflags |= WAYPOINTFLAG_PROTECTED;
472 // finds the waypoints near the bot initiating a navigation query
473 float navigation_markroutes_nearestwaypoints(entity this, float maxdist)
476 // navigation_testtracewalk = true;
478 IL_EACH(g_waypoints, !it.wpconsidered,
482 m1 = it.origin + it.mins;
483 m2 = it.origin + it.maxs;
485 v.x = bound(m1_x, v.x, m2_x);
486 v.y = bound(m1_y, v.y, m2_y);
487 v.z = bound(m1_z, v.z, m2_z);
491 vector diff = v - this.origin;
492 diff.z = max(0, diff.z);
493 if(vdist(diff, <, maxdist))
495 it.wpconsidered = true;
496 if (tracewalk(this, this.origin, this.mins, this.maxs, v, bot_navigation_movemode))
498 it.wpnearestpoint = v;
499 it.wpcost = waypoint_getdistancecost(this.origin, v) + it.dmg;
506 //navigation_testtracewalk = false;
510 // updates a path link if a spawnfunc_waypoint link is better than the current one
511 void navigation_markroutes_checkwaypoint(entity w, entity wp, float cost2, vector p)
520 v.x = bound(m1_x, p.x, m2_x);
521 v.y = bound(m1_y, p.y, m2_y);
522 v.z = bound(m1_z, p.z, m2_z);
526 cost2 += waypoint_getdistancecost(p, v);
527 if (wp.wpcost > cost2)
532 wp.wpnearestpoint = v;
536 // queries the entire spawnfunc_waypoint network for pathes leading away from the bot
537 void navigation_markroutes(entity this, entity fixed_source_waypoint)
542 IL_EACH(g_waypoints, true,
544 it.wpconsidered = false;
545 it.wpnearestpoint = '0 0 0';
546 it.wpcost = 10000000;
551 if(fixed_source_waypoint)
553 fixed_source_waypoint.wpconsidered = true;
554 fixed_source_waypoint.wpnearestpoint = fixed_source_waypoint.origin + 0.5 * (fixed_source_waypoint.mins + fixed_source_waypoint.maxs);
555 fixed_source_waypoint.wpcost = fixed_source_waypoint.dmg;
556 fixed_source_waypoint.wpfire = 1;
557 fixed_source_waypoint.enemy = NULL;
561 // try a short range search for the nearest waypoints, and expand the search repeatedly if none are found
562 // as this search is expensive we will use lower values if the bot is on the air
563 float increment, maxdistance;
564 if(IS_ONGROUND(this))
575 for(int j = increment; !navigation_markroutes_nearestwaypoints(this, j) && j < maxdistance; j += increment);
578 bool searching = true;
582 IL_EACH(g_waypoints, it.wpfire,
587 p = it.wpnearestpoint;
589 wp = it.wp00;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp00mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
590 wp = it.wp01;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp01mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
591 wp = it.wp02;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp02mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
592 wp = it.wp03;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp03mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
593 wp = it.wp04;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp04mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
594 wp = it.wp05;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp05mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
595 wp = it.wp06;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp06mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
596 wp = it.wp07;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp07mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
597 wp = it.wp08;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp08mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
598 wp = it.wp09;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp09mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
599 wp = it.wp10;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp10mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
600 wp = it.wp11;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp11mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
601 wp = it.wp12;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp12mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
602 wp = it.wp13;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp13mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
603 wp = it.wp14;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp14mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
604 wp = it.wp15;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp15mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
605 wp = it.wp16;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp16mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
606 wp = it.wp17;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp17mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
607 wp = it.wp18;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp18mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
608 wp = it.wp19;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp19mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
609 wp = it.wp20;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp20mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
610 wp = it.wp21;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp21mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
611 wp = it.wp22;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp22mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
612 wp = it.wp23;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp23mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
613 wp = it.wp24;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp24mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
614 wp = it.wp25;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp25mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
615 wp = it.wp26;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp26mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
616 wp = it.wp27;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp27mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
617 wp = it.wp28;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp28mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
618 wp = it.wp29;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp29mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
619 wp = it.wp30;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp30mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
620 wp = it.wp31;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp31mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
621 }}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}
626 // queries the entire spawnfunc_waypoint network for pathes leading to the bot
627 void navigation_markroutes_inverted(entity fixed_source_waypoint)
631 IL_EACH(g_waypoints, true,
633 it.wpconsidered = false;
634 it.wpnearestpoint = '0 0 0';
635 it.wpcost = 10000000;
640 if(fixed_source_waypoint)
642 fixed_source_waypoint.wpconsidered = true;
643 fixed_source_waypoint.wpnearestpoint = fixed_source_waypoint.origin + 0.5 * (fixed_source_waypoint.mins + fixed_source_waypoint.maxs);
644 fixed_source_waypoint.wpcost = fixed_source_waypoint.dmg; // the cost to get from X to fixed_source_waypoint
645 fixed_source_waypoint.wpfire = 1;
646 fixed_source_waypoint.enemy = NULL;
650 error("need to start with a waypoint\n");
653 bool searching = true;
657 IL_EACH(g_waypoints, it.wpfire,
661 cost = it.wpcost; // cost to walk from it to home
662 p = it.wpnearestpoint;
664 IL_EACH(g_waypoints, it != wp,
666 if(!waypoint_islinked(it, wp))
668 cost2 = cost + it.dmg;
669 navigation_markroutes_checkwaypoint(wp, it, cost2, p);
675 // updates the best goal according to a weighted calculation of travel cost and item value of a new proposed item
676 void navigation_routerating(entity this, entity e, float f, float rangebias)
684 rangebias = waypoint_getdistancecost_simple(rangebias);
685 f = waypoint_getdistancecost_simple(f);
689 bool rate_wps = false;
690 if((e.flags & FL_INWATER) || (e.flags & FL_PARTIALGROUND))
695 traceline(e.origin, e.origin + '0 0 -1500', true, NULL);
696 int t = pointcontents(trace_endpos + '0 0 1');
697 if(t != CONTENT_SOLID )
699 if(t == CONTENT_WATER || t == CONTENT_SLIME || t == CONTENT_LAVA)
701 else if(tracebox_hits_trigger_hurt(e.origin, e.mins, e.maxs, trace_endpos))
709 entity best_wp = NULL;
710 float best_dist = 10000;
711 IL_EACH(g_waypoints, vdist(it.origin - theEnemy.origin, <, 500)
712 && vdist(it.origin - this.origin, >, 100)
713 && !(it.wpflags & WAYPOINTFLAG_TELEPORT),
715 float dist = vlen(it.origin - theEnemy.origin);
716 if (dist < best_dist)
728 vector o = (e.absmin + e.absmax) * 0.5;
730 //print("routerating ", etos(e), " = ", ftos(f), " - ", ftos(rangebias), "\n");
732 // Evaluate path using jetpack
734 if(this.items & IT_JETPACK)
735 if(autocvar_bot_ai_navigation_jetpack)
736 if(vdist(this.origin - o, >, autocvar_bot_ai_navigation_jetpack_mindistance))
738 vector pointa, pointb;
740 LOG_DEBUG("jetpack ai: evaluating path for ", e.classname);
743 traceline(this.origin, this.origin + '0 0 65535', MOVE_NORMAL, this);
744 pointa = trace_endpos - '0 0 1';
747 traceline(o, o + '0 0 65535', MOVE_NORMAL, e);
748 pointb = trace_endpos - '0 0 1';
750 // Can I see these two points from the sky?
751 traceline(pointa, pointb, MOVE_NORMAL, this);
753 if(trace_fraction==1)
755 LOG_DEBUG("jetpack ai: can bridge these two points");
757 // Lower the altitude of these points as much as possible
758 float zdistance, xydistance, cost, t, fuel;
759 vector down, npa, npb;
761 down = '0 0 -1' * (STAT(PL_MAX, this).z - STAT(PL_MIN, this).z) * 10;
767 if(npa.z<=this.absmax.z)
770 if(npb.z<=e.absmax.z)
773 traceline(npa, npb, MOVE_NORMAL, this);
774 if(trace_fraction==1)
780 while(trace_fraction == 1);
783 // Rough estimation of fuel consumption
784 // (ignores acceleration and current xyz velocity)
785 xydistance = vlen(pointa - pointb);
786 zdistance = fabs(pointa.z - this.origin.z);
788 t = zdistance / autocvar_g_jetpack_maxspeed_up;
789 t += xydistance / autocvar_g_jetpack_maxspeed_side;
790 fuel = t * autocvar_g_jetpack_fuel * 0.8;
792 LOG_DEBUG("jetpack ai: required fuel ", ftos(fuel), " this.ammo_fuel ", ftos(this.ammo_fuel));
795 if(this.ammo_fuel>fuel)
798 // (as onground costs calculation is mostly based on distances, here we do the same establishing some relationship
799 // - between air and ground speeds)
801 cost = xydistance / (autocvar_g_jetpack_maxspeed_side/autocvar_sv_maxspeed);
802 cost += zdistance / (autocvar_g_jetpack_maxspeed_up/autocvar_sv_maxspeed);
805 // Compare against other goals
806 f = f * rangebias / (rangebias + cost);
808 if (navigation_bestrating < f)
810 LOG_DEBUG("jetpack path: added goal ", e.classname, " (with rating ", ftos(f), ")");
811 navigation_bestrating = f;
812 navigation_bestgoal = e;
813 this.navigation_jetpack_goal = e;
814 this.navigation_jetpack_point = pointb;
822 //te_wizspike(e.origin);
825 // update the cached spawnfunc_waypoint link on a dynamic item entity
826 if(e.classname == "waypoint" && !(e.wpflags & WAYPOINTFLAG_PERSONAL))
832 if(autocvar_g_waypointeditor && e.nearestwaypointtimeout >= 0 && time > e.nearestwaypointtimeout)
833 e.nearestwaypoint = NULL;
835 if ((!e.nearestwaypoint || e.navigation_dynamicgoal)
836 && e.nearestwaypointtimeout >= 0 && time > e.nearestwaypointtimeout)
838 nwp = navigation_findnearestwaypoint(e, true);
840 e.nearestwaypoint = nwp;
843 LOG_DEBUG("FAILED to find a nearest waypoint to '", e.classname, "' #", etos(e));
845 if(!e.navigation_dynamicgoal)
846 e.blacklisted = true;
850 LOG_DEBUG("The entity '", e.classname, "' is going to be excluded from path finding during this match");
855 if(e.navigation_dynamicgoal)
856 e.nearestwaypointtimeout = time + 2;
857 else if(autocvar_g_waypointeditor)
858 e.nearestwaypointtimeout = time + 3 + random() * 2;
860 nwp = e.nearestwaypoint;
863 LOG_DEBUG("-- checking ", e.classname, " (with cost ", ftos(nwp.wpcost), ")");
865 if (nwp.wpcost < 10000000)
867 //te_wizspike(nwp.wpnearestpoint);
868 LOG_DEBUG(e.classname, " ", ftos(f), "/(1+", ftos((nwp.wpcost + vlen(e.origin - nwp.wpnearestpoint))), "/", ftos(rangebias), ") = ");
869 f = f * rangebias / (rangebias + (nwp.wpcost + vlen(o - nwp.wpnearestpoint)));
870 LOG_DEBUG("considering ", e.classname, " (with rating ", ftos(f), ")");
871 if (navigation_bestrating < f)
873 LOG_DEBUG("ground path: added goal ", e.classname, " (with rating ", ftos(f), ")");
874 navigation_bestrating = f;
875 navigation_bestgoal = e;
880 // adds an item to the the goal stack with the path to a given item
881 bool navigation_routetogoal(entity this, entity e, vector startposition)
883 // if there is no goal, just exit
889 // put the entity on the goal stack
890 //print("routetogoal ", etos(e), "\n");
891 navigation_pushroute(this, e);
893 if(e.classname == "waypoint" && !(e.wpflags & WAYPOINTFLAG_PERSONAL))
895 this.wp_goal_prev1 = this.wp_goal_prev0;
896 this.wp_goal_prev0 = e;
900 if(e==this.navigation_jetpack_goal)
903 // if it can reach the goal there is nothing more to do
904 if (tracewalk(this, startposition, STAT(PL_MIN, this), STAT(PL_MAX, this), (e.absmin + e.absmax) * 0.5, bot_navigation_movemode))
907 entity nearest_wp = NULL;
908 // see if there are waypoints describing a path to the item
909 if(e.classname != "waypoint" || (e.wpflags & WAYPOINTFLAG_PERSONAL))
911 e = e.nearestwaypoint;
915 e = e.enemy; // we already have added it, so...
920 if(nearest_wp && nearest_wp.enemy)
922 // often path can be optimized by not adding the nearest waypoint
923 if(tracewalk(this, nearest_wp.enemy.origin, STAT(PL_MIN, this), STAT(PL_MAX, this), (this.goalentity.absmin + this.goalentity.absmax) * 0.5, bot_navigation_movemode))
924 e = nearest_wp.enemy;
929 // add the spawnfunc_waypoint to the path
930 navigation_pushroute(this, e);
940 // removes any currently touching waypoints from the goal stack
941 // (this is how bots detect if they reached a goal)
942 void navigation_poptouchedgoals(entity this)
946 m1 = org + this.mins;
947 m2 = org + this.maxs;
949 if(this.goalcurrent.wpflags & WAYPOINTFLAG_TELEPORT)
951 // make sure jumppad is really hit, don't rely on distance based checks
952 // as they may report a touch even if it didn't really happen
953 if(this.lastteleporttime>0)
954 if(time - this.lastteleporttime < ((this.goalcurrent.wpflags & WAYPOINTFLAG_PERSONAL) ? 2 : 0.15))
956 if(this.aistatus & AI_STATUS_WAYPOINT_PERSONAL_GOING)
957 if(this.goalcurrent.wpflags & WAYPOINTFLAG_PERSONAL && this.goalcurrent.owner==this)
959 this.aistatus &= ~AI_STATUS_WAYPOINT_PERSONAL_GOING;
960 this.aistatus |= AI_STATUS_WAYPOINT_PERSONAL_REACHED;
962 navigation_poproute(this);
967 // If for some reason the bot is closer to the next goal, pop the current one
968 if(this.goalstack01 && !wasfreed(this.goalstack01))
969 if(vlen2(this.goalcurrent.origin - this.origin) > vlen2(this.goalstack01.origin - this.origin))
970 if(checkpvs(this.origin + this.view_ofs, this.goalstack01))
971 if(tracewalk(this, this.origin, this.mins, this.maxs, (this.goalstack01.absmin + this.goalstack01.absmax) * 0.5, bot_navigation_movemode))
973 LOG_DEBUG("path optimized for ", this.netname, ", removed a goal from the queue");
974 navigation_poproute(this);
975 // TODO this may also be a nice idea to do "early" (e.g. by
976 // manipulating the vlen() comparisons) to shorten paths in
977 // general - this would make bots walk more "on rails" than
978 // "zigzagging" which they currently do with sufficiently
979 // random-like waypoints, and thus can make a nice bot
980 // personality property
983 // Loose goal touching check when running
984 if(this.aistatus & AI_STATUS_RUNNING)
985 if(this.goalcurrent.classname=="waypoint")
986 if(!(this.goalcurrent.wpflags & WAYPOINTFLAG_TELEPORT))
987 if(vlen(this.velocity - eZ * this.velocity.z) >= autocvar_sv_maxspeed) // if -really- running
989 if(vdist(this.origin - this.goalcurrent.origin, <, 150))
991 traceline(this.origin + this.view_ofs , this.goalcurrent.origin, true, NULL);
992 if(trace_fraction==1)
994 // Detect personal waypoints
995 if(this.aistatus & AI_STATUS_WAYPOINT_PERSONAL_GOING)
996 if(this.goalcurrent.wpflags & WAYPOINTFLAG_PERSONAL && this.goalcurrent.owner==this)
998 this.aistatus &= ~AI_STATUS_WAYPOINT_PERSONAL_GOING;
999 this.aistatus |= AI_STATUS_WAYPOINT_PERSONAL_REACHED;
1002 navigation_poproute(this);
1007 while (this.goalcurrent && !IS_PLAYER(this.goalcurrent))
1009 vector gc_min = this.goalcurrent.absmin;
1010 vector gc_max = this.goalcurrent.absmax;
1011 if(this.goalcurrent.classname == "waypoint" && !this.goalcurrent.wpisbox)
1013 gc_min = this.goalcurrent.origin - '1 1 1' * 12;
1014 gc_max = this.goalcurrent.origin + '1 1 1' * 12;
1016 if(!boxesoverlap(m1, m2, gc_min, gc_max))
1019 if((this.goalcurrent.wpflags & WAYPOINTFLAG_TELEPORT))
1022 // Detect personal waypoints
1023 if(this.aistatus & AI_STATUS_WAYPOINT_PERSONAL_GOING)
1024 if(this.goalcurrent.wpflags & WAYPOINTFLAG_PERSONAL && this.goalcurrent.owner==this)
1026 this.aistatus &= ~AI_STATUS_WAYPOINT_PERSONAL_GOING;
1027 this.aistatus |= AI_STATUS_WAYPOINT_PERSONAL_REACHED;
1030 navigation_poproute(this);
1034 // begin a goal selection session (queries spawnfunc_waypoint network)
1035 void navigation_goalrating_start(entity this)
1037 if(this.aistatus & AI_STATUS_STUCK)
1040 this.navigation_jetpack_goal = NULL;
1041 navigation_bestrating = -1;
1042 navigation_clearroute(this);
1043 navigation_bestgoal = NULL;
1044 navigation_markroutes(this, NULL);
1047 // ends a goal selection session (updates goal stack to the best goal)
1048 void navigation_goalrating_end(entity this)
1050 if(this.aistatus & AI_STATUS_STUCK)
1053 navigation_routetogoal(this, navigation_bestgoal, this.origin);
1054 LOG_DEBUG("best goal ", this.goalcurrent.classname);
1056 // If the bot got stuck then try to reach the farthest waypoint
1057 if (!this.goalentity && autocvar_bot_wander_enable)
1059 if (!(this.aistatus & AI_STATUS_STUCK))
1061 LOG_DEBUG(this.netname, " cannot walk to any goal");
1062 this.aistatus |= AI_STATUS_STUCK;
1067 void botframe_updatedangerousobjects(float maxupdate)
1069 vector m1, m2, v, o;
1072 IL_EACH(g_waypoints, true,
1077 IL_EACH(g_bot_dodge, it.bot_dodge,
1080 v.x = bound(m1_x, v.x, m2_x);
1081 v.y = bound(m1_y, v.y, m2_y);
1082 v.z = bound(m1_z, v.z, m2_z);
1083 o = (it.absmin + it.absmax) * 0.5;
1084 d = waypoint_getdistancecost_simple(it.bot_dodgerating) - waypoint_getdistancecost(o, v);
1087 traceline(o, v, true, NULL);
1088 if (trace_fraction == 1)
1089 danger = danger + d;
1099 void navigation_unstuck(entity this)
1101 float search_radius = 1000;
1103 if (!autocvar_bot_wander_enable)
1106 if (!bot_waypoint_queue_owner)
1108 LOG_DEBUG(this.netname, " stuck, taking over the waypoints queue");
1109 bot_waypoint_queue_owner = this;
1110 bot_waypoint_queue_bestgoal = NULL;
1111 bot_waypoint_queue_bestgoalrating = 0;
1114 if(bot_waypoint_queue_owner!=this)
1117 if (bot_waypoint_queue_goal)
1119 // evaluate the next goal on the queue
1120 float d = vlen2(this.origin - bot_waypoint_queue_goal.origin);
1121 LOG_DEBUG(this.netname, " evaluating ", bot_waypoint_queue_goal.classname, " with distance ", ftos(d));
1122 if(tracewalk(bot_waypoint_queue_goal, this.origin, STAT(PL_MIN, this), STAT(PL_MAX, this), bot_waypoint_queue_goal.origin, bot_navigation_movemode))
1124 if( d > bot_waypoint_queue_bestgoalrating)
1126 bot_waypoint_queue_bestgoalrating = d;
1127 bot_waypoint_queue_bestgoal = bot_waypoint_queue_goal;
1130 bot_waypoint_queue_goal = bot_waypoint_queue_goal.bot_waypoint_queue_nextgoal;
1132 if (!bot_waypoint_queue_goal)
1134 if (bot_waypoint_queue_bestgoal)
1136 LOG_DEBUG(this.netname, " stuck, reachable waypoint found, heading to it");
1137 navigation_routetogoal(this, bot_waypoint_queue_bestgoal, this.origin);
1138 this.bot_strategytime = time + autocvar_bot_ai_strategyinterval;
1139 this.aistatus &= ~AI_STATUS_STUCK;
1143 LOG_DEBUG(this.netname, " stuck, cannot walk to any waypoint at all");
1146 bot_waypoint_queue_owner = NULL;
1151 if(bot_strategytoken!=this)
1154 // build a new queue
1155 LOG_DEBUG(this.netname, " stuck, scanning reachable waypoints within ", ftos(search_radius)," qu");
1157 entity first = NULL;
1159 FOREACH_ENTITY_RADIUS(this.origin, search_radius, it.classname == "waypoint" && !(it.wpflags & WAYPOINTFLAG_GENERATED),
1161 if(bot_waypoint_queue_goal)
1162 bot_waypoint_queue_goal.bot_waypoint_queue_nextgoal = it;
1166 bot_waypoint_queue_goal = it;
1167 bot_waypoint_queue_goal.bot_waypoint_queue_nextgoal = NULL;
1171 bot_waypoint_queue_goal = first;
1174 LOG_DEBUG(this.netname, " stuck, cannot walk to any waypoint at all");
1175 bot_waypoint_queue_owner = NULL;
1180 // Support for debugging tracewalk visually
1182 void debugresetnodes()
1184 debuglastnode = '0 0 0';
1187 void debugnode(entity this, vector node)
1189 if (!IS_PLAYER(this))
1192 if(debuglastnode=='0 0 0')
1194 debuglastnode = node;
1198 te_lightning2(NULL, node, debuglastnode);
1199 debuglastnode = node;
1202 void debugnodestatus(vector position, float status)
1208 case DEBUG_NODE_SUCCESS:
1211 case DEBUG_NODE_WARNING:
1214 case DEBUG_NODE_FAIL:
1221 te_customflash(position, 40, 2, c);
1224 // Support for debugging the goal stack visually
1227 .vector lastposition;
1229 // Debug the goal stack visually
1230 void debuggoalstack(entity this)
1235 if(this.goalcounter==0)goal=this.goalcurrent;
1236 else if(this.goalcounter==1)goal=this.goalstack01;
1237 else if(this.goalcounter==2)goal=this.goalstack02;
1238 else if(this.goalcounter==3)goal=this.goalstack03;
1239 else if(this.goalcounter==4)goal=this.goalstack04;
1240 else if(this.goalcounter==5)goal=this.goalstack05;
1241 else if(this.goalcounter==6)goal=this.goalstack06;
1242 else if(this.goalcounter==7)goal=this.goalstack07;
1243 else if(this.goalcounter==8)goal=this.goalstack08;
1244 else if(this.goalcounter==9)goal=this.goalstack09;
1245 else if(this.goalcounter==10)goal=this.goalstack10;
1246 else if(this.goalcounter==11)goal=this.goalstack11;
1247 else if(this.goalcounter==12)goal=this.goalstack12;
1248 else if(this.goalcounter==13)goal=this.goalstack13;
1249 else if(this.goalcounter==14)goal=this.goalstack14;
1250 else if(this.goalcounter==15)goal=this.goalstack15;
1251 else if(this.goalcounter==16)goal=this.goalstack16;
1252 else if(this.goalcounter==17)goal=this.goalstack17;
1253 else if(this.goalcounter==18)goal=this.goalstack18;
1254 else if(this.goalcounter==19)goal=this.goalstack19;
1255 else if(this.goalcounter==20)goal=this.goalstack20;
1256 else if(this.goalcounter==21)goal=this.goalstack21;
1257 else if(this.goalcounter==22)goal=this.goalstack22;
1258 else if(this.goalcounter==23)goal=this.goalstack23;
1259 else if(this.goalcounter==24)goal=this.goalstack24;
1260 else if(this.goalcounter==25)goal=this.goalstack25;
1261 else if(this.goalcounter==26)goal=this.goalstack26;
1262 else if(this.goalcounter==27)goal=this.goalstack27;
1263 else if(this.goalcounter==28)goal=this.goalstack28;
1264 else if(this.goalcounter==29)goal=this.goalstack29;
1265 else if(this.goalcounter==30)goal=this.goalstack30;
1266 else if(this.goalcounter==31)goal=this.goalstack31;
1271 this.goalcounter = 0;
1272 this.lastposition='0 0 0';
1276 if(this.lastposition=='0 0 0')
1279 org = this.lastposition;
1282 go = ( goal.absmin + goal.absmax ) * 0.5;
1283 te_lightning2(NULL, org, go);
1284 this.lastposition = go;