LiU Electronic Press
Full-text not available in DiVA
Author:
Olsson, Per-Magnus (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab) (Linköping University, The Institute of Technology)
Doherty, Patrick (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab) (Linköping University, The Institute of Technology)
Title:
The Observer Algorithm For Visibility Approximation
Department:
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, The Institute of Technology
Publication type:
Conference paper (Refereed)
Language:
English
In:
10th Scandinavian Conference on Artificial Intelligence, SCAI 2008
Conference:
10th Scandinavian Conference on Artificial Intelligence (SCAI 2008), 26-28 May 2008, Stockholm, Sweden
Place of publ.: Nederländerna Publisher: IOS Press
Series:
Frontiers in Artificial Intelligence and Applications, ISSN 0922-6389; 173
Pages:
3-11
Year of publ.:
2008
URI:
urn:nbn:se:liu:diva-44552
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-44552
ISBN:
978-1-58603-867-0, e-978-1-60750-335-4
ISI:
000273520700001
Local ID:
77004
Subject category:
Computer Science
SVEP category:
Computer science
Keywords(en) :
Visibility; occlusion calculation; unmanned aerial vehicles; constrained path planning
Abstract(en) :

We present a novel algorithm for visibility approximation that is substantially faster than ray casting based algorithms. The algorithm does not require extensive preprocessing or specialized hardware as most other algorithms do. We test this algorithm in several settings: rural, mountainous and urban areas, with different view ranges and grid cell sizes. By changing the size of the grid cells that the algorithm uses, it is possible to tailor the algorithm between speed and accuracy.

Available from:
2009-10-10
Created:
2009-10-10
Last updated:
2013-06-26
Statistics:
34 hits