Refine
Year of publication
- 2023 (68) (remove)
Document Type
- Article (68) (remove)
Keywords
- Bacillaceae (2)
- Biotechnological application (2)
- Subtilases (2)
- Subtilisin (2)
- additive manufacturing (2)
- factory planning (2)
- manufacturing flexibility (2)
- ultrasound (2)
- (Poly)saccharides (1)
- 60er Jahre (1)
- Acyl-amino acids (1)
- Aeroelasticity (1)
- Aloe vera (1)
- Aminoacylase (1)
- Anammox (1)
- Antibias (1)
- Architectural design (1)
- Automotive safety approach (1)
- Autonomy (1)
- Bacillus atrophaeus spores (1)
Institute
- Fachbereich Medizintechnik und Technomathematik (23)
- Fachbereich Luft- und Raumfahrttechnik (12)
- ECSM European Center for Sustainable Mobility (11)
- Fachbereich Chemie und Biotechnologie (11)
- INB - Institut für Nano- und Biotechnologien (11)
- Fachbereich Wirtschaftswissenschaften (7)
- IfB - Institut für Bioengineering (7)
- Fachbereich Maschinenbau und Mechatronik (6)
- Fachbereich Energietechnik (5)
- Nowum-Energy (4)
- Fachbereich Bauingenieurwesen (2)
- Fachbereich Elektrotechnik und Informationstechnik (2)
- Arbeitsstelle fuer Hochschuldidaktik und Studienberatung (1)
- Fachbereich Architektur (1)
- Institut fuer Angewandte Polymerchemie (1)
- MASKOR Institut für Mobile Autonome Systeme und Kognitive Robotik (1)
Even the shortest flight through unknown, cluttered environments requires reliable local path planning algorithms to avoid unforeseen obstacles. The algorithm must evaluate alternative flight paths and identify the best path if an obstacle blocks its way. Commonly, weighted sums are used here. This work shows that weighted Chebyshev distances and factorial achievement scalarising functions are suitable alternatives to weighted sums if combined with the 3DVFH* local path planning algorithm. Both methods considerably reduce the failure probability of simulated flights in various environments. The standard 3DVFH* uses a weighted sum and has a failure probability of 50% in the test environments. A factorial achievement scalarising function, which minimises the worst combination of two out of four objective functions, reaches a failure probability of 26%; A weighted Chebyshev distance, which optimises the worst objective, has a failure probability of 30%. These results show promise for further enhancements and to support broader applicability.