Refine
Year of publication
- 2023 (101) (remove)
Document Type
- Article (59)
- Conference Proceeding (30)
- Part of a Book (5)
- Preprint (2)
- Talk (2)
- Book (1)
- Contribution to a Periodical (1)
- Habilitation (1)
Language
- English (101) (remove)
Keywords
- Information extraction (3)
- Natural language processing (3)
- Associated liquids (2)
- Bacillaceae (2)
- Biotechnological application (2)
- Diversity Management (2)
- Engineering Habitus (2)
- Future Skills (2)
- Interdisciplinarity (2)
- Organizational Culture (2)
- Power plants (2)
- Subtilases (2)
- Subtilisin (2)
- Sustainability (2)
- additive manufacturing (2)
- factory planning (2)
- manufacturing flexibility (2)
- ultrasound (2)
- (Poly)saccharides (1)
- (R)- or (S)- gamma-valerolactone (1)
Institute
- Fachbereich Medizintechnik und Technomathematik (28)
- Fachbereich Elektrotechnik und Informationstechnik (18)
- ECSM European Center for Sustainable Mobility (16)
- Fachbereich Luft- und Raumfahrttechnik (16)
- Fachbereich Chemie und Biotechnologie (13)
- Fachbereich Energietechnik (13)
- INB - Institut für Nano- und Biotechnologien (11)
- IfB - Institut für Bioengineering (9)
- Fachbereich Wirtschaftswissenschaften (7)
- Fachbereich Maschinenbau und Mechatronik (6)
- MASKOR Institut für Mobile Autonome Systeme und Kognitive Robotik (6)
- Nowum-Energy (6)
- Kommission für Forschung und Entwicklung (3)
- Solar-Institut Jülich (3)
- Fachbereich Bauingenieurwesen (2)
- Institut fuer Angewandte Polymerchemie (2)
- Arbeitsstelle fuer Hochschuldidaktik und Studienberatung (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.