TheGameCreators - CodeBase

Return to the CodeBase listing

Category: Libraries

Version: 1.0

Information

Uploaded: 17th Aug 2016 14:39

Modified: 17th Aug 2016 14:39

Author: JohnStabler

Summary

A set of simple functions to add pathinfinding to your 3D levels.

Full Description

Load your level, add waypoint data and then tell it to calculate. It uses some maths and temporary objects & raycasting to work out which waypoints are visible to each other. Once the precalculations are done you can call the GetRoute(startWP, endWP) function at any time in your game loop to generate a path between two way points. <br /> <br /> Iterate backwards over the route array to get from the start to the finish.<br /> <br /> Check out this thread for an example: https://forum.thegamecreators.com/thread/217692

AGKV2 BASIC Source Code

` This code was downloaded from The Game Creators

` It is reproduced here with full permission

` http://www.thegamecreators.com

dim waypoints[] as Waypoint

function AddWaypoint(x#, y#, z#, level)

local w as Waypoint

w.X = x#

w.Y = y#

w.Z = z#

w.Level = level

waypoints.Insert(w)

waypoints[waypoints.Length].ID = waypoints.Length

endfunction

function GetRoute(startWaypoint, endWaypoint)

CalculateRoutes(startWaypoint, endWaypoint)

local route as integer[]

current = endWaypoint

shortest# = 99999999

while current <> startWaypoint

nxt = current

for i = 0 to waypoints[current].Neighbours.Length

if waypoints[waypoints[current].Neighbours[i].WaypointID].Distance < shortest#

shortest# = waypoints[waypoints[current].Neighbours[i].WaypointID].Distance

nxt = waypoints[current].Neighbours[i].WaypointID

endif

next i

current = nxt

route.Insert(nxt)

endwhile

endfunction route

function ClearWaypoints()

for i = 0 to waypoints.Length

waypoints[i].Neighbours.Length = -1

next i

waypoints.Length = -1

endfunction

function CalculateWaypoints(maxWaypointDistance#, waypointDiameter#)

for i = 0 to waypoints.Length

waypoints[i].WaypointObject = CreateObjectSphere(waypointDiameter#, 4, 4)

SetObjectPosition(waypoints[i].WaypointObject, waypoints[i].X, waypoints[i].Y, waypoints[i].Z)

SetObjectColor(waypoints[i].WaypointObject, 255, 0, 0, 31)

SetObjectTransparency(waypoints[i].WaypointObject, 1)

next i

for p1 = 0 to waypoints.Length

for p2 = 0 to waypoints.Length

if p1 <> p2

if Abs(waypoints[p1].Level - waypoints[p2].Level) <= 1

dist# = WaypointDistance(waypoints[p1].X, waypoints[p1].Y, waypoints[p1].Z, waypoints[p2].X, waypoints[p2].Y, waypoints[p2].Z)

if dist# <= maxWaypointDistance#

r = ObjectRayCast(0, waypoints[p1].X, waypoints[p1].Y, waypoints[p1].Z, waypoints[p2].X, waypoints[p2].Y, waypoints[p2].Z)

if r = waypoints[p2].WaypointObject

local n as WaypointNeighbour

n.WaypointID = p2

n.Distance = dist#

waypoints[p1].Neighbours.Insert(n)

endif

next p2

next p1

for i = 0 to waypoints.Length

DeleteObject(waypoints[i].WaypointObject)

next i

endfunction

function CalculateRoutes(startWaypoint, endWaypoint)

ResetWaypoints()

waypoints[startWaypoint].Distance = 0

candidate = startWaypoint

while candidate > -1

waypoints[candidate].Processed = 1

for i = 0 to waypoints[candidate].Neighbours.Length

di# = waypoints[candidate].Distance + waypoints[candidate].Neighbours[i].Distance

if di# < waypoints[waypoints[candidate].Neighbours[i].WaypointID].Distance

waypoints[waypoints[candidate].Neighbours[i].WaypointID].Distance = di#

endif

next i

candidate = GetShortest()

if candidate = endWaypoint

exitfunction

endif

endwhile

endfunction

function ResetWaypoints()

for i = 0 to waypoints.Length

waypoints[i].Processed = 0

waypoints[i].Distance = 99999999

next i

endfunction

function GetShortest()

short# = 99999999

candidate = -1

for i = 0 to waypoints.Length

if waypoints[i].Processed = 0 and waypoints[i].Distance < short#

short# = waypoints[i].Distance

candidate = i

endif

next i

endfunction candidate

function WaypointDistance(x1#, y1#, z1#, x2#, y2#, z2#)

xx# = x2# - x1#

yy# = y2# - y1#

zz# = z2# - z1#

r = Sqrt((xx# * xx#) + (yy# * yy#) + (zz# * zz#))

endfunction r

type Waypoint

ID as integer

WaypointObject as integer

X as float

Y as float

Z as float

Level as integer

Distance as float

Processed as integer

Neighbours as WaypointNeighbour[]

endtype

type WaypointNeighbour

WaypointID as integer

Distance as float

endtype

Download

Please login to download

Comments

Blendman

Posted: 13th Jan 2017 07:58

Hi
Could you provide a simple example, with 3DCube to see how to use your code ?

Thanks a lot.

CodeBase - 3D Pathfinding

Information

Summary

Full Description

AGKV2 BASIC Source Code

Download

Screen Shot

Author

Comments

Author Name:	JohnStabler
CodeBase Entries:	1