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 // rough simulation of walking from one point to another to test if a path
19 // can be traveled, used for waypoint linking and havocbot
21 bool tracewalk(entity e, vector start, vector m1, vector m2, vector end, float movemode)
33 if(autocvar_bot_debug_tracewalk)
42 dist = totaldist = vlen(move);
43 dir = normalize(move);
45 ignorehazards = false;
48 // Analyze starting point
49 traceline(start, start, MOVE_NORMAL, e);
50 if (trace_dpstartcontents & (DPCONTENTS_SLIME | DPCONTENTS_LAVA))
54 traceline( start, start + '0 0 -65536', MOVE_NORMAL, e);
55 if (trace_dpstartcontents & (DPCONTENTS_SLIME | DPCONTENTS_LAVA))
61 tracebox(start, m1, m2, start, MOVE_NOMONSTERS, e);
65 if(autocvar_bot_debug_tracewalk)
66 debugnodestatus(start, DEBUG_NODE_FAIL);
68 //print("tracewalk: ", vtos(start), " is a bad start\n");
77 if (boxesoverlap(end, end, org + m1 + '-1 -1 -1', org + m2 + '1 1 1'))
80 if(autocvar_bot_debug_tracewalk)
81 debugnodestatus(org, DEBUG_NODE_SUCCESS);
83 //print("tracewalk: ", vtos(start), " can reach ", vtos(end), "\n");
86 if(autocvar_bot_debug_tracewalk)
93 dist = dist - stepdist;
94 traceline(org, org, MOVE_NORMAL, e);
97 if (trace_dpstartcontents & (DPCONTENTS_SLIME | DPCONTENTS_LAVA))
99 // hazards blocking path
100 if(autocvar_bot_debug_tracewalk)
101 debugnodestatus(org, DEBUG_NODE_FAIL);
103 //print("tracewalk: ", vtos(start), " hits a hazard when trying to reach ", vtos(end), "\n");
107 if (trace_dpstartcontents & DPCONTENTS_LIQUIDSMASK)
109 move = normalize(end - org);
110 tracebox(org, m1, m2, org + move * stepdist, movemode, e);
112 if(autocvar_bot_debug_tracewalk)
113 debugnode(e, trace_endpos);
115 if (trace_fraction < 1)
118 org = trace_endpos - normalize(org - trace_endpos) * stepdist;
119 for (; org.z < end.z + e.maxs.z; org.z += stepdist)
121 if(autocvar_bot_debug_tracewalk)
124 if(pointcontents(org) == CONTENT_EMPTY)
128 if(pointcontents(org + '0 0 1') != CONTENT_EMPTY)
130 if(autocvar_bot_debug_tracewalk)
131 debugnodestatus(org, DEBUG_NODE_FAIL);
134 //print("tracewalk: ", vtos(start), " failed under water\n");
144 move = dir * stepdist + org;
145 tracebox(org, m1, m2, move, movemode, e);
147 if(autocvar_bot_debug_tracewalk)
148 debugnode(e, trace_endpos);
151 if (trace_fraction < 1)
153 // check if we can walk over this obstacle, possibly by jumpstepping
154 tracebox(org + stepheightvec, m1, m2, move + stepheightvec, movemode, e);
155 if (trace_fraction < 1 || trace_startsolid)
157 tracebox(org + jumpstepheightvec, m1, m2, move + jumpstepheightvec, movemode, e);
158 if (trace_fraction < 1 || trace_startsolid)
160 if(autocvar_bot_debug_tracewalk)
161 debugnodestatus(trace_endpos, DEBUG_NODE_WARNING);
164 traceline( org, move, movemode, e);
165 if ( trace_ent.classname == "door_rotating" || trace_ent.classname == "door")
169 while(trace_ent.classname == "door_rotating" || trace_ent.classname == "door")
171 nextmove = move + (dir * stepdist);
172 traceline( move, nextmove, movemode, e);
178 if(autocvar_bot_debug_tracewalk)
179 debugnodestatus(trace_endpos, DEBUG_NODE_FAIL);
181 //print("tracewalk: ", vtos(start), " hit something when trying to reach ", vtos(end), "\n");
182 //te_explosion(trace_endpos);
183 //print(ftos(e.dphitcontentsmask), "\n");
184 return false; // failed
196 // trace down from stepheight as far as possible and move there,
197 // if this starts in solid we try again without the stepup, and
198 // if that also fails we assume it is a wall
199 // (this is the same logic as the Quake walkmove function used)
200 tracebox(move, m1, m2, move + '0 0 -65536', movemode, e);
202 // moved successfully
206 c = pointcontents(org + '0 0 1');
207 if (!(c == CONTENT_WATER || c == CONTENT_LAVA || c == CONTENT_SLIME))
217 //print("tracewalk: ", vtos(start), " did not arrive at ", vtos(end), " but at ", vtos(org), "\n");
219 // moved but didn't arrive at the intended destination
220 if(autocvar_bot_debug_tracewalk)
221 debugnodestatus(org, DEBUG_NODE_FAIL);
226 /////////////////////////////////////////////////////////////////////////////
228 /////////////////////////////////////////////////////////////////////////////
230 // completely empty the goal stack, used when deciding where to go
231 void navigation_clearroute(entity this)
233 //print("bot ", etos(this), " clear\n");
234 this.navigation_hasgoals = false;
235 this.goalcurrent = NULL;
236 this.goalstack01 = NULL;
237 this.goalstack02 = NULL;
238 this.goalstack03 = NULL;
239 this.goalstack04 = NULL;
240 this.goalstack05 = NULL;
241 this.goalstack06 = NULL;
242 this.goalstack07 = NULL;
243 this.goalstack08 = NULL;
244 this.goalstack09 = NULL;
245 this.goalstack10 = NULL;
246 this.goalstack11 = NULL;
247 this.goalstack12 = NULL;
248 this.goalstack13 = NULL;
249 this.goalstack14 = NULL;
250 this.goalstack15 = NULL;
251 this.goalstack16 = NULL;
252 this.goalstack17 = NULL;
253 this.goalstack18 = NULL;
254 this.goalstack19 = NULL;
255 this.goalstack20 = NULL;
256 this.goalstack21 = NULL;
257 this.goalstack22 = NULL;
258 this.goalstack23 = NULL;
259 this.goalstack24 = NULL;
260 this.goalstack25 = NULL;
261 this.goalstack26 = NULL;
262 this.goalstack27 = NULL;
263 this.goalstack28 = NULL;
264 this.goalstack29 = NULL;
265 this.goalstack30 = NULL;
266 this.goalstack31 = NULL;
269 // add a new goal at the beginning of the stack
270 // (in other words: add a new prerequisite before going to the later goals)
271 // NOTE: when a waypoint is added, the WP gets pushed first, then the
272 // next-closest WP on the shortest path to the WP
273 // That means, if the stack overflows, the bot will know how to do the FIRST 32
274 // steps to the goal, and then recalculate the path.
275 void navigation_pushroute(entity this, entity e)
277 //print("bot ", etos(this), " push ", etos(e), "\n");
278 this.goalstack31 = this.goalstack30;
279 this.goalstack30 = this.goalstack29;
280 this.goalstack29 = this.goalstack28;
281 this.goalstack28 = this.goalstack27;
282 this.goalstack27 = this.goalstack26;
283 this.goalstack26 = this.goalstack25;
284 this.goalstack25 = this.goalstack24;
285 this.goalstack24 = this.goalstack23;
286 this.goalstack23 = this.goalstack22;
287 this.goalstack22 = this.goalstack21;
288 this.goalstack21 = this.goalstack20;
289 this.goalstack20 = this.goalstack19;
290 this.goalstack19 = this.goalstack18;
291 this.goalstack18 = this.goalstack17;
292 this.goalstack17 = this.goalstack16;
293 this.goalstack16 = this.goalstack15;
294 this.goalstack15 = this.goalstack14;
295 this.goalstack14 = this.goalstack13;
296 this.goalstack13 = this.goalstack12;
297 this.goalstack12 = this.goalstack11;
298 this.goalstack11 = this.goalstack10;
299 this.goalstack10 = this.goalstack09;
300 this.goalstack09 = this.goalstack08;
301 this.goalstack08 = this.goalstack07;
302 this.goalstack07 = this.goalstack06;
303 this.goalstack06 = this.goalstack05;
304 this.goalstack05 = this.goalstack04;
305 this.goalstack04 = this.goalstack03;
306 this.goalstack03 = this.goalstack02;
307 this.goalstack02 = this.goalstack01;
308 this.goalstack01 = this.goalcurrent;
309 this.goalcurrent = e;
312 // remove first goal from stack
313 // (in other words: remove a prerequisite for reaching the later goals)
314 // (used when a spawnfunc_waypoint is reached)
315 void navigation_poproute(entity this)
317 //print("bot ", etos(this), " pop\n");
318 this.goalcurrent = this.goalstack01;
319 this.goalstack01 = this.goalstack02;
320 this.goalstack02 = this.goalstack03;
321 this.goalstack03 = this.goalstack04;
322 this.goalstack04 = this.goalstack05;
323 this.goalstack05 = this.goalstack06;
324 this.goalstack06 = this.goalstack07;
325 this.goalstack07 = this.goalstack08;
326 this.goalstack08 = this.goalstack09;
327 this.goalstack09 = this.goalstack10;
328 this.goalstack10 = this.goalstack11;
329 this.goalstack11 = this.goalstack12;
330 this.goalstack12 = this.goalstack13;
331 this.goalstack13 = this.goalstack14;
332 this.goalstack14 = this.goalstack15;
333 this.goalstack15 = this.goalstack16;
334 this.goalstack16 = this.goalstack17;
335 this.goalstack17 = this.goalstack18;
336 this.goalstack18 = this.goalstack19;
337 this.goalstack19 = this.goalstack20;
338 this.goalstack20 = this.goalstack21;
339 this.goalstack21 = this.goalstack22;
340 this.goalstack22 = this.goalstack23;
341 this.goalstack23 = this.goalstack24;
342 this.goalstack24 = this.goalstack25;
343 this.goalstack25 = this.goalstack26;
344 this.goalstack26 = this.goalstack27;
345 this.goalstack27 = this.goalstack28;
346 this.goalstack28 = this.goalstack29;
347 this.goalstack29 = this.goalstack30;
348 this.goalstack30 = this.goalstack31;
349 this.goalstack31 = NULL;
352 float navigation_waypoint_will_link(vector v, vector org, entity ent, float walkfromwp, float bestdist)
355 dist = vlen(v - org);
358 traceline(v, org, true, ent);
359 if (trace_fraction == 1)
363 if (tracewalk(ent, v, PL_MIN_CONST, PL_MAX_CONST, org, bot_navigation_movemode))
368 if (tracewalk(ent, org, PL_MIN_CONST, PL_MAX_CONST, v, bot_navigation_movemode))
376 // find the spawnfunc_waypoint near a dynamic goal such as a dropped weapon
377 entity navigation_findnearestwaypoint_withdist_except(entity ent, float walkfromwp, float bestdist, entity except)
379 vector pm1 = ent.origin + ent.mins;
380 vector pm2 = ent.origin + ent.maxs;
382 // do two scans, because box test is cheaper
383 IL_EACH(g_waypoints, it != ent && it != except,
385 if(boxesoverlap(pm1, pm2, it.absmin, it.absmax))
389 vector org = ent.origin + 0.5 * (ent.mins + ent.maxs);
390 org.z = ent.origin.z + ent.mins.z - PL_MIN_CONST.z; // player height
391 // TODO possibly make other code have the same support for bboxes
393 org = org + ent.tag_entity.origin;
394 if (navigation_testtracewalk)
400 // box check failed, try walk
401 IL_EACH(g_waypoints, it != ent,
405 vector wm1 = it.origin + it.mins;
406 vector wm2 = it.origin + it.maxs;
407 v.x = bound(wm1_x, org.x, wm2_x);
408 v.y = bound(wm1_y, org.y, wm2_y);
409 v.z = bound(wm1_z, org.z, wm2_z);
413 if(navigation_waypoint_will_link(v, org, ent, walkfromwp, bestdist))
415 bestdist = vlen(v - org);
421 entity navigation_findnearestwaypoint(entity ent, float walkfromwp)
423 entity wp = navigation_findnearestwaypoint_withdist_except(ent, walkfromwp, 1050, NULL);
424 if (autocvar_g_waypointeditor_auto)
426 entity wp2 = navigation_findnearestwaypoint_withdist_except(ent, walkfromwp, 1050, wp);
428 wp.wpflags |= WAYPOINTFLAG_PROTECTED;
433 // finds the waypoints near the bot initiating a navigation query
434 float navigation_markroutes_nearestwaypoints(entity this, float maxdist)
437 // navigation_testtracewalk = true;
439 IL_EACH(g_waypoints, !it.wpconsidered,
443 m1 = it.origin + it.mins;
444 m2 = it.origin + it.maxs;
446 v.x = bound(m1_x, v.x, m2_x);
447 v.y = bound(m1_y, v.y, m2_y);
448 v.z = bound(m1_z, v.z, m2_z);
452 vector diff = v - this.origin;
453 diff.z = max(0, diff.z);
454 if(vdist(diff, <, maxdist))
456 it.wpconsidered = true;
457 if (tracewalk(this, this.origin, this.mins, this.maxs, v, bot_navigation_movemode))
459 it.wpnearestpoint = v;
460 it.wpcost = vlen(v - this.origin) + it.dmg;
467 //navigation_testtracewalk = false;
471 // updates a path link if a spawnfunc_waypoint link is better than the current one
472 void navigation_markroutes_checkwaypoint(entity w, entity wp, float cost2, vector p)
481 v.x = bound(m1_x, p.x, m2_x);
482 v.y = bound(m1_y, p.y, m2_y);
483 v.z = bound(m1_z, p.z, m2_z);
487 cost2 = cost2 + vlen(v - p);
488 if (wp.wpcost > cost2)
493 wp.wpnearestpoint = v;
497 // queries the entire spawnfunc_waypoint network for pathes leading away from the bot
498 void navigation_markroutes(entity this, entity fixed_source_waypoint)
503 IL_EACH(g_waypoints, true,
505 it.wpconsidered = false;
506 it.wpnearestpoint = '0 0 0';
507 it.wpcost = 10000000;
512 if(fixed_source_waypoint)
514 fixed_source_waypoint.wpconsidered = true;
515 fixed_source_waypoint.wpnearestpoint = fixed_source_waypoint.origin + 0.5 * (fixed_source_waypoint.mins + fixed_source_waypoint.maxs);
516 fixed_source_waypoint.wpcost = fixed_source_waypoint.dmg;
517 fixed_source_waypoint.wpfire = 1;
518 fixed_source_waypoint.enemy = NULL;
522 // try a short range search for the nearest waypoints, and expand the search repeatedly if none are found
523 // as this search is expensive we will use lower values if the bot is on the air
524 float increment, maxdistance;
525 if(IS_ONGROUND(this))
536 for(int j = increment; !navigation_markroutes_nearestwaypoints(this, j) && j < maxdistance; j += increment);
539 bool searching = true;
543 IL_EACH(g_waypoints, it.wpfire,
548 p = it.wpnearestpoint;
550 wp = it.wp00;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp00mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
551 wp = it.wp01;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp01mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
552 wp = it.wp02;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp02mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
553 wp = it.wp03;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp03mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
554 wp = it.wp04;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp04mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
555 wp = it.wp05;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp05mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
556 wp = it.wp06;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp06mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
557 wp = it.wp07;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp07mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
558 wp = it.wp08;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp08mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
559 wp = it.wp09;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp09mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
560 wp = it.wp10;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp10mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
561 wp = it.wp11;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp11mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
562 wp = it.wp12;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp12mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
563 wp = it.wp13;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp13mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
564 wp = it.wp14;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp14mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
565 wp = it.wp15;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp15mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
566 wp = it.wp16;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp16mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
567 wp = it.wp17;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp17mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
568 wp = it.wp18;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp18mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
569 wp = it.wp19;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp19mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
570 wp = it.wp20;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp20mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
571 wp = it.wp21;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp21mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
572 wp = it.wp22;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp22mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
573 wp = it.wp23;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp23mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
574 wp = it.wp24;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp24mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
575 wp = it.wp25;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp25mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
576 wp = it.wp26;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp26mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
577 wp = it.wp27;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp27mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
578 wp = it.wp28;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp28mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
579 wp = it.wp29;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp29mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
580 wp = it.wp30;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp30mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
581 wp = it.wp31;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp31mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
582 }}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}
587 // queries the entire spawnfunc_waypoint network for pathes leading to the bot
588 void navigation_markroutes_inverted(entity fixed_source_waypoint)
592 IL_EACH(g_waypoints, true,
594 it.wpconsidered = false;
595 it.wpnearestpoint = '0 0 0';
596 it.wpcost = 10000000;
601 if(fixed_source_waypoint)
603 fixed_source_waypoint.wpconsidered = true;
604 fixed_source_waypoint.wpnearestpoint = fixed_source_waypoint.origin + 0.5 * (fixed_source_waypoint.mins + fixed_source_waypoint.maxs);
605 fixed_source_waypoint.wpcost = fixed_source_waypoint.dmg; // the cost to get from X to fixed_source_waypoint
606 fixed_source_waypoint.wpfire = 1;
607 fixed_source_waypoint.enemy = NULL;
611 error("need to start with a waypoint\n");
614 bool searching = true;
618 IL_EACH(g_waypoints, it.wpfire,
622 cost = it.wpcost; // cost to walk from it to home
623 p = it.wpnearestpoint;
625 IL_EACH(g_waypoints, true,
627 if(wp != it.wp00) if(wp != it.wp01) if(wp != it.wp02) if(wp != it.wp03)
628 if(wp != it.wp04) if(wp != it.wp05) if(wp != it.wp06) if(wp != it.wp07)
629 if(wp != it.wp08) if(wp != it.wp09) if(wp != it.wp10) if(wp != it.wp11)
630 if(wp != it.wp12) if(wp != it.wp13) if(wp != it.wp14) if(wp != it.wp15)
631 if(wp != it.wp16) if(wp != it.wp17) if(wp != it.wp18) if(wp != it.wp19)
632 if(wp != it.wp20) if(wp != it.wp21) if(wp != it.wp22) if(wp != it.wp23)
633 if(wp != it.wp24) if(wp != it.wp25) if(wp != it.wp26) if(wp != it.wp27)
634 if(wp != it.wp28) if(wp != it.wp29) if(wp != it.wp30) if(wp != it.wp31)
636 cost2 = cost + it.dmg;
637 navigation_markroutes_checkwaypoint(wp, it, cost2, p);
643 // updates the best goal according to a weighted calculation of travel cost and item value of a new proposed item
644 void navigation_routerating(entity this, entity e, float f, float rangebias)
654 bool rate_wps = false;
655 if((e.flags & FL_INWATER) || (e.flags & FL_PARTIALGROUND))
660 traceline(e.origin, e.origin + '0 0 -1500', true, NULL);
661 int t = pointcontents(trace_endpos + '0 0 1');
662 if(t != CONTENT_SOLID )
664 if(t == CONTENT_WATER || t == CONTENT_SLIME || t == CONTENT_LAVA)
666 else if(tracebox_hits_trigger_hurt(e.origin, e.mins, e.maxs, trace_endpos))
674 entity best_wp = NULL;
675 float best_dist = 10000;
676 IL_EACH(g_waypoints, vdist(it.origin - theEnemy.origin, <, 500)
677 && vdist(it.origin - this.origin, >, 100)
678 && !(it.wpflags & WAYPOINTFLAG_TELEPORT),
680 float dist = vlen(it.origin - theEnemy.origin);
681 if (dist < best_dist)
693 vector o = (e.absmin + e.absmax) * 0.5;
695 //print("routerating ", etos(e), " = ", ftos(f), " - ", ftos(rangebias), "\n");
697 // Evaluate path using jetpack
699 if(this.items & IT_JETPACK)
700 if(autocvar_bot_ai_navigation_jetpack)
701 if(vdist(this.origin - o, >, autocvar_bot_ai_navigation_jetpack_mindistance))
703 vector pointa, pointb;
705 LOG_DEBUG("jetpack ai: evaluating path for ", e.classname);
708 traceline(this.origin, this.origin + '0 0 65535', MOVE_NORMAL, this);
709 pointa = trace_endpos - '0 0 1';
712 traceline(o, o + '0 0 65535', MOVE_NORMAL, e);
713 pointb = trace_endpos - '0 0 1';
715 // Can I see these two points from the sky?
716 traceline(pointa, pointb, MOVE_NORMAL, this);
718 if(trace_fraction==1)
720 LOG_DEBUG("jetpack ai: can bridge these two points");
722 // Lower the altitude of these points as much as possible
723 float zdistance, xydistance, cost, t, fuel;
724 vector down, npa, npb;
726 down = '0 0 -1' * (STAT(PL_MAX, this).z - STAT(PL_MIN, this).z) * 10;
732 if(npa.z<=this.absmax.z)
735 if(npb.z<=e.absmax.z)
738 traceline(npa, npb, MOVE_NORMAL, this);
739 if(trace_fraction==1)
745 while(trace_fraction == 1);
748 // Rough estimation of fuel consumption
749 // (ignores acceleration and current xyz velocity)
750 xydistance = vlen(pointa - pointb);
751 zdistance = fabs(pointa.z - this.origin.z);
753 t = zdistance / autocvar_g_jetpack_maxspeed_up;
754 t += xydistance / autocvar_g_jetpack_maxspeed_side;
755 fuel = t * autocvar_g_jetpack_fuel * 0.8;
757 LOG_DEBUG("jetpack ai: required fuel ", ftos(fuel), " this.ammo_fuel ", ftos(this.ammo_fuel));
760 if(this.ammo_fuel>fuel)
763 // (as onground costs calculation is mostly based on distances, here we do the same establishing some relationship
764 // - between air and ground speeds)
766 cost = xydistance / (autocvar_g_jetpack_maxspeed_side/autocvar_sv_maxspeed);
767 cost += zdistance / (autocvar_g_jetpack_maxspeed_up/autocvar_sv_maxspeed);
770 // Compare against other goals
771 f = f * rangebias / (rangebias + cost);
773 if (navigation_bestrating < f)
775 LOG_DEBUG("jetpack path: added goal ", e.classname, " (with rating ", ftos(f), ")");
776 navigation_bestrating = f;
777 navigation_bestgoal = e;
778 this.navigation_jetpack_goal = e;
779 this.navigation_jetpack_point = pointb;
787 //te_wizspike(e.origin);
790 // update the cached spawnfunc_waypoint link on a dynamic item entity
791 if(e.classname == "waypoint" && !(e.wpflags & WAYPOINTFLAG_PERSONAL))
801 if(e.flags & FL_ITEM)
803 if (!(e.flags & FL_WEAPON))
804 if(e.nearestwaypoint)
807 else if (e.flags & FL_WEAPON)
809 if(e.classname != "droppedweapon")
810 if(e.nearestwaypoint)
815 if (time > e.nearestwaypointtimeout)
817 nwp = navigation_findnearestwaypoint(e, true);
819 e.nearestwaypoint = nwp;
822 LOG_DEBUG("FAILED to find a nearest waypoint to '", e.classname, "' #", etos(e));
824 if(e.flags & FL_ITEM)
825 e.blacklisted = true;
826 else if (e.flags & FL_WEAPON)
828 if(e.classname != "droppedweapon")
829 e.blacklisted = true;
834 LOG_DEBUG("The entity '", e.classname, "' is going to be excluded from path finding during this match");
839 // TODO: Cleaner solution, probably handling this timeout from ctf.qc
840 if(e.classname=="item_flag_team")
841 e.nearestwaypointtimeout = time + 2;
843 e.nearestwaypointtimeout = time + random() * 3 + 5;
845 nwp = e.nearestwaypoint;
848 LOG_DEBUG("-- checking ", e.classname, " (with cost ", ftos(nwp.wpcost), ")");
850 if (nwp.wpcost < 10000000)
852 //te_wizspike(nwp.wpnearestpoint);
853 LOG_DEBUG(e.classname, " ", ftos(f), "/(1+", ftos((nwp.wpcost + vlen(e.origin - nwp.wpnearestpoint))), "/", ftos(rangebias), ") = ");
854 f = f * rangebias / (rangebias + (nwp.wpcost + vlen(o - nwp.wpnearestpoint)));
855 LOG_DEBUG("considering ", e.classname, " (with rating ", ftos(f), ")");
856 if (navigation_bestrating < f)
858 LOG_DEBUG("ground path: added goal ", e.classname, " (with rating ", ftos(f), ")");
859 navigation_bestrating = f;
860 navigation_bestgoal = e;
865 // adds an item to the the goal stack with the path to a given item
866 bool navigation_routetogoal(entity this, entity e, vector startposition)
870 // if there is no goal, just exit
874 this.navigation_hasgoals = true;
876 // put the entity on the goal stack
877 //print("routetogoal ", etos(e), "\n");
878 navigation_pushroute(this, e);
880 if(e.classname == "waypoint" && !(e.wpflags & WAYPOINTFLAG_PERSONAL))
882 this.wp_goal_prev1 = this.wp_goal_prev0;
883 this.wp_goal_prev0 = e;
887 if(e==this.navigation_jetpack_goal)
890 // if it can reach the goal there is nothing more to do
891 if (tracewalk(this, startposition, STAT(PL_MIN, this), STAT(PL_MAX, this), (e.absmin + e.absmax) * 0.5, bot_navigation_movemode))
894 // see if there are waypoints describing a path to the item
895 if(e.classname != "waypoint" || (e.wpflags & WAYPOINTFLAG_PERSONAL))
896 e = e.nearestwaypoint;
898 e = e.enemy; // we already have added it, so...
905 // add the spawnfunc_waypoint to the path
906 navigation_pushroute(this, e);
916 // removes any currently touching waypoints from the goal stack
917 // (this is how bots detect if they reached a goal)
918 void navigation_poptouchedgoals(entity this)
922 m1 = org + this.mins;
923 m2 = org + this.maxs;
925 while(this.goalcurrent && wasfreed(this.goalcurrent))
926 navigation_poproute(this);
928 if(this.goalcurrent.wpflags & WAYPOINTFLAG_TELEPORT)
930 // make sure jumppad is really hit, don't rely on distance based checks
931 // as they may report a touch even if it didn't really happen
932 if(this.lastteleporttime>0)
933 if(time - this.lastteleporttime < ((this.goalcurrent.wpflags & WAYPOINTFLAG_PERSONAL) ? 2 : 0.15))
935 if(this.aistatus & AI_STATUS_WAYPOINT_PERSONAL_GOING)
936 if(this.goalcurrent.wpflags & WAYPOINTFLAG_PERSONAL && this.goalcurrent.owner==this)
938 this.aistatus &= ~AI_STATUS_WAYPOINT_PERSONAL_GOING;
939 this.aistatus |= AI_STATUS_WAYPOINT_PERSONAL_REACHED;
941 navigation_poproute(this);
946 if(this.goalcurrent.bot_pickup_respawning)
948 if(!this.goalcurrent.solid)
950 this.goalcurrent.bot_pickup_respawning = false;
953 // If for some reason the bot is closer to the next goal, pop the current one
954 if(this.goalstack01 && !wasfreed(this.goalstack01))
955 if(vlen2(this.goalcurrent.origin - this.origin) > vlen2(this.goalstack01.origin - this.origin))
956 if(checkpvs(this.origin + this.view_ofs, this.goalstack01))
957 if(tracewalk(this, this.origin, this.mins, this.maxs, (this.goalstack01.absmin + this.goalstack01.absmax) * 0.5, bot_navigation_movemode))
959 LOG_DEBUG("path optimized for ", this.netname, ", removed a goal from the queue");
960 navigation_poproute(this);
961 // TODO this may also be a nice idea to do "early" (e.g. by
962 // manipulating the vlen() comparisons) to shorten paths in
963 // general - this would make bots walk more "on rails" than
964 // "zigzagging" which they currently do with sufficiently
965 // random-like waypoints, and thus can make a nice bot
966 // personality property
969 // Loose goal touching check when running
970 if(this.aistatus & AI_STATUS_RUNNING)
971 if(this.goalcurrent.classname=="waypoint")
972 if(!(this.goalcurrent.wpflags & WAYPOINTFLAG_TELEPORT))
973 if(vlen(this.velocity - eZ * this.velocity.z) >= autocvar_sv_maxspeed) // if -really- running
975 if(vdist(this.origin - this.goalcurrent.origin, <, 150))
977 traceline(this.origin + this.view_ofs , this.goalcurrent.origin, true, NULL);
978 if(trace_fraction==1)
980 // Detect personal waypoints
981 if(this.aistatus & AI_STATUS_WAYPOINT_PERSONAL_GOING)
982 if(this.goalcurrent.wpflags & WAYPOINTFLAG_PERSONAL && this.goalcurrent.owner==this)
984 this.aistatus &= ~AI_STATUS_WAYPOINT_PERSONAL_GOING;
985 this.aistatus |= AI_STATUS_WAYPOINT_PERSONAL_REACHED;
988 navigation_poproute(this);
993 while (this.goalcurrent && !IS_PLAYER(this.goalcurrent) && boxesoverlap(m1, m2, this.goalcurrent.absmin, this.goalcurrent.absmax))
995 if((this.goalcurrent.wpflags & WAYPOINTFLAG_TELEPORT))
998 // Detect personal waypoints
999 if(this.aistatus & AI_STATUS_WAYPOINT_PERSONAL_GOING)
1000 if(this.goalcurrent.wpflags & WAYPOINTFLAG_PERSONAL && this.goalcurrent.owner==this)
1002 this.aistatus &= ~AI_STATUS_WAYPOINT_PERSONAL_GOING;
1003 this.aistatus |= AI_STATUS_WAYPOINT_PERSONAL_REACHED;
1006 navigation_poproute(this);
1010 // begin a goal selection session (queries spawnfunc_waypoint network)
1011 void navigation_goalrating_start(entity this)
1013 if(this.aistatus & AI_STATUS_STUCK)
1016 this.navigation_jetpack_goal = NULL;
1017 navigation_bestrating = -1;
1018 this.navigation_hasgoals = false;
1019 navigation_clearroute(this);
1020 navigation_bestgoal = NULL;
1021 navigation_markroutes(this, NULL);
1024 // ends a goal selection session (updates goal stack to the best goal)
1025 void navigation_goalrating_end(entity this)
1027 if(this.aistatus & AI_STATUS_STUCK)
1030 navigation_routetogoal(this, navigation_bestgoal, this.origin);
1031 LOG_DEBUG("best goal ", this.goalcurrent.classname);
1033 // If the bot got stuck then try to reach the farthest waypoint
1034 if (!this.navigation_hasgoals)
1035 if (autocvar_bot_wander_enable)
1037 if (!(this.aistatus & AI_STATUS_STUCK))
1039 LOG_DEBUG(this.netname, " cannot walk to any goal");
1040 this.aistatus |= AI_STATUS_STUCK;
1043 this.navigation_hasgoals = false; // Reset this value
1047 void botframe_updatedangerousobjects(float maxupdate)
1049 vector m1, m2, v, o;
1052 IL_EACH(g_waypoints, true,
1057 IL_EACH(g_bot_dodge, it.bot_dodge,
1060 v.x = bound(m1_x, v.x, m2_x);
1061 v.y = bound(m1_y, v.y, m2_y);
1062 v.z = bound(m1_z, v.z, m2_z);
1063 o = (it.absmin + it.absmax) * 0.5;
1064 d = it.bot_dodgerating - vlen(o - v);
1067 traceline(o, v, true, NULL);
1068 if (trace_fraction == 1)
1069 danger = danger + d;
1079 void navigation_unstuck(entity this)
1081 float search_radius = 1000;
1083 if (!autocvar_bot_wander_enable)
1086 if (!bot_waypoint_queue_owner)
1088 LOG_DEBUG(this.netname, " stuck, taking over the waypoints queue");
1089 bot_waypoint_queue_owner = this;
1090 bot_waypoint_queue_bestgoal = NULL;
1091 bot_waypoint_queue_bestgoalrating = 0;
1094 if(bot_waypoint_queue_owner!=this)
1097 if (bot_waypoint_queue_goal)
1099 // evaluate the next goal on the queue
1100 float d = vlen2(this.origin - bot_waypoint_queue_goal.origin);
1101 LOG_DEBUG(this.netname, " evaluating ", bot_waypoint_queue_goal.classname, " with distance ", ftos(d));
1102 if(tracewalk(bot_waypoint_queue_goal, this.origin, STAT(PL_MIN, this), STAT(PL_MAX, this), bot_waypoint_queue_goal.origin, bot_navigation_movemode))
1104 if( d > bot_waypoint_queue_bestgoalrating)
1106 bot_waypoint_queue_bestgoalrating = d;
1107 bot_waypoint_queue_bestgoal = bot_waypoint_queue_goal;
1110 bot_waypoint_queue_goal = bot_waypoint_queue_goal.bot_waypoint_queue_nextgoal;
1112 if (!bot_waypoint_queue_goal)
1114 if (bot_waypoint_queue_bestgoal)
1116 LOG_DEBUG(this.netname, " stuck, reachable waypoint found, heading to it");
1117 navigation_routetogoal(this, bot_waypoint_queue_bestgoal, this.origin);
1118 this.bot_strategytime = time + autocvar_bot_ai_strategyinterval;
1119 this.aistatus &= ~AI_STATUS_STUCK;
1123 LOG_DEBUG(this.netname, " stuck, cannot walk to any waypoint at all");
1126 bot_waypoint_queue_owner = NULL;
1131 if(bot_strategytoken!=this)
1134 // build a new queue
1135 LOG_DEBUG(this.netname, " stuck, scanning reachable waypoints within ", ftos(search_radius)," qu");
1137 entity first = NULL;
1139 FOREACH_ENTITY_RADIUS(this.origin, search_radius, it.classname == "waypoint" && !(it.wpflags & WAYPOINTFLAG_GENERATED),
1141 if(bot_waypoint_queue_goal)
1142 bot_waypoint_queue_goal.bot_waypoint_queue_nextgoal = it;
1146 bot_waypoint_queue_goal = it;
1147 bot_waypoint_queue_goal.bot_waypoint_queue_nextgoal = NULL;
1151 bot_waypoint_queue_goal = first;
1154 LOG_DEBUG(this.netname, " stuck, cannot walk to any waypoint at all");
1155 bot_waypoint_queue_owner = NULL;
1160 // Support for debugging tracewalk visually
1162 void debugresetnodes()
1164 debuglastnode = '0 0 0';
1167 void debugnode(entity this, vector node)
1169 if (!IS_PLAYER(this))
1172 if(debuglastnode=='0 0 0')
1174 debuglastnode = node;
1178 te_lightning2(NULL, node, debuglastnode);
1179 debuglastnode = node;
1182 void debugnodestatus(vector position, float status)
1188 case DEBUG_NODE_SUCCESS:
1191 case DEBUG_NODE_WARNING:
1194 case DEBUG_NODE_FAIL:
1201 te_customflash(position, 40, 2, c);
1204 // Support for debugging the goal stack visually
1207 .vector lastposition;
1209 // Debug the goal stack visually
1210 void debuggoalstack(entity this)
1215 if(this.goalcounter==0)goal=this.goalcurrent;
1216 else if(this.goalcounter==1)goal=this.goalstack01;
1217 else if(this.goalcounter==2)goal=this.goalstack02;
1218 else if(this.goalcounter==3)goal=this.goalstack03;
1219 else if(this.goalcounter==4)goal=this.goalstack04;
1220 else if(this.goalcounter==5)goal=this.goalstack05;
1221 else if(this.goalcounter==6)goal=this.goalstack06;
1222 else if(this.goalcounter==7)goal=this.goalstack07;
1223 else if(this.goalcounter==8)goal=this.goalstack08;
1224 else if(this.goalcounter==9)goal=this.goalstack09;
1225 else if(this.goalcounter==10)goal=this.goalstack10;
1226 else if(this.goalcounter==11)goal=this.goalstack11;
1227 else if(this.goalcounter==12)goal=this.goalstack12;
1228 else if(this.goalcounter==13)goal=this.goalstack13;
1229 else if(this.goalcounter==14)goal=this.goalstack14;
1230 else if(this.goalcounter==15)goal=this.goalstack15;
1231 else if(this.goalcounter==16)goal=this.goalstack16;
1232 else if(this.goalcounter==17)goal=this.goalstack17;
1233 else if(this.goalcounter==18)goal=this.goalstack18;
1234 else if(this.goalcounter==19)goal=this.goalstack19;
1235 else if(this.goalcounter==20)goal=this.goalstack20;
1236 else if(this.goalcounter==21)goal=this.goalstack21;
1237 else if(this.goalcounter==22)goal=this.goalstack22;
1238 else if(this.goalcounter==23)goal=this.goalstack23;
1239 else if(this.goalcounter==24)goal=this.goalstack24;
1240 else if(this.goalcounter==25)goal=this.goalstack25;
1241 else if(this.goalcounter==26)goal=this.goalstack26;
1242 else if(this.goalcounter==27)goal=this.goalstack27;
1243 else if(this.goalcounter==28)goal=this.goalstack28;
1244 else if(this.goalcounter==29)goal=this.goalstack29;
1245 else if(this.goalcounter==30)goal=this.goalstack30;
1246 else if(this.goalcounter==31)goal=this.goalstack31;
1251 this.goalcounter = 0;
1252 this.lastposition='0 0 0';
1256 if(this.lastposition=='0 0 0')
1259 org = this.lastposition;
1262 go = ( goal.absmin + goal.absmax ) * 0.5;
1263 te_lightning2(NULL, org, go);
1264 this.lastposition = go;