you mean want to find the shortest path including all fires?
if so,there's a function :
Router.java
public static Route get(MotionlessObject origin, Collection destinations,
CostFunction costFunc)
that takes a collection of destinations and returns an optimal route to one
of desitnations (estimating cost using costFunc) .
have fun,
Mohammad Mehdi Saboorian
Member of SBCe_Saviour
On 5/16/05, Silvia Suárez <sandrea_sb@hotmail.com> wrote:
>
> Dear all,
>
> If I have some fires collection, How could I calculate the total minimum
> distance that some FireBrigade Agent would has to walk along of this route
> of fires until getting the end of the route?
>
> I am using Yabapi by Takeshi Morimoto.
>
> Somebody can give me some idea?
>
> Thanks,
>
> Silvia
>
> _______________________________________________
> robocup-rescue-s mailing list
> robocup-rescue-s@mailman.cc.gatech.edu
> https://mailman.cc.gatech.edu/mailman/listinfo/robocup-rescue-s
>
_______________________________________________
robocup-rescue-s mailing list
robocup-rescue-s@mailman.cc.gatech.edu
https://mailman.cc.gatech.edu/mailman/listinfo/robocup-rescue-s
This archive was generated by hypermail 2.1.3 : Tue 17 May 2005 - 05:34:33 GMT