Path Planning for Altruistically Negotiating Systems: The Near-Sighted Tarzan Algorithm

@inproceedings{Mahoney2006PathPF,
  title={Path Planning for Altruistically Negotiating Systems: The Near-Sighted Tarzan Algorithm},
  author={Arthur W. Mahoney and Daniel W. Watson},
  booktitle={PDPTA},
  year={2006}
}
This paper introduces a variant of the Rapidlyexploring Random Leafy Tree, called the Near-sighted Tarzan Algorithm, that performs path planning (for message routing) in a discrete graph simulating the communication network of an Altruistically Negotiating System. The Near-sighted Tarzan Algorithm is designed to operate in environments with similar… CONTINUE READING