Multi-agent search with interim positive information

Lau, H; Huang, S; Dissanayake, G

Multi-agent search with interim positive information

Lau, H Huang, S

Dissanayake, G

Permalink

Publication Type:: Conference Proceeding
Citation:: IEEE International Conference on Intelligent Robots and Systems, 2007, pp. 3791 - 3796
Issue Date:: 2007-12-01

Closed Access

	Filename	Description	Size
	2007001030.pdf		762.27 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Lau, H	en_US
dc.contributor.author	Huang, S https://orcid.org/0000-0002-6124-4178	en_US
dc.contributor.author	Dissanayake, G https://orcid.org/0000-0002-7992-0680	en_US
dc.date.issued	2007-12-01	en_US
dc.identifier.citation	IEEE International Conference on Intelligent Robots and Systems, 2007, pp. 3791 - 3796	en_US
dc.identifier.isbn	1424409128	en_US
dc.identifier.isbn	9781424409129	en_US
dc.identifier.uri	http://hdl.handle.net/10453/2891
dc.description.abstract	A problem of searching with multiple searchers and scouts is presented. Unlike most search problems that terminate as soon as the target is found, successful detection by scouts only improve on the current knowledge of the moving target's location, such that the searchers can more effectively find and service the target in the future. The team must correspondingly plan not only to maximize the probability of the searchers directly finding the target, but also give them the best chance of exploiting any new information from potential scout detections. It is shown that this need to plan for replanning can be addressed by equivalently solving a series of simpler detection search problems that always do terminate on detection. Optimal and heuristic solution methods for this Searcher/Scout problem are derived, such that the capabilities of all the sensing platforms in a search task are harnessed even when only a subset are capable of actually servicing the target. ©2007 IEEE.	en_US
dc.relation.ispartof	IEEE International Conference on Intelligent Robots and Systems	en_US
dc.relation.isbasedon	10.1109/IROS.2007.4399304	en_US
dc.title	Multi-agent search with interim positive information	en_US
dc.type	Conference Proceeding
utslib.for	0913 Mechanical Engineering	en_US
dc.location.activity	San Diego, USA	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Mechanical and Mechatronic Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - CAS - Centre for Autonomous Systems
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US

Abstract:

A problem of searching with multiple searchers and scouts is presented. Unlike most search problems that terminate as soon as the target is found, successful detection by scouts only improve on the current knowledge of the moving target's location, such that the searchers can more effectively find and service the target in the future. The team must correspondingly plan not only to maximize the probability of the searchers directly finding the target, but also give them the best chance of exploiting any new information from potential scout detections. It is shown that this need to plan for replanning can be addressed by equivalently solving a series of simpler detection search problems that always do terminate on detection. Optimal and heuristic solution methods for this Searcher/Scout problem are derived, such that the capabilities of all the sensing platforms in a search task are harnessed even when only a subset are capable of actually servicing the target. ©2007 IEEE.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/2891