Understanding the Search Behaviour of Greedy Best-First Search

A classical result in optimal search shows that A* with an admissible and consistent heuristic expands every state whose f-value is below the optimal solution cost and no state whose f-value is above the optimal solution cost. For satisficing search algorithms, a similarly clear understanding is currently lacking. We examine the search behaviour of greedy best-first search (gbfs) in order to make progress towards such an understanding. We introduce the concept of high-water mark benches, which separate the search space into areas that are searched by a gbfs algorithm in sequence. High-water mark benches allow us to exactly determine the set of states that are not expanded under any gbfs tie-breaking strategy. For the remaining states, we show that some are expanded by all gbfs searches, while others are expanded only if certain conditions are met

最良優先探索のための探索非局在化手法

学位の種別: 課程博士審査委員会委員 : （主査）東京大学教授 Fukunaga Alex, 東京大学教授 山口 和紀, 東京大学准教授 田中 哲朗, 東京大学准教授 金子 知適, 東京大学准教授 森畑 明昌University of Tokyo(東京大学

Search Progress and Potentially Expanded States in Greedy Best-First Search

A classical result in optimal search shows that A* with an admissible and consistent heuristic expands every state whose f-value is below the optimal solution cost and no state whose f-value is above the optimal solution cost. For satisficing search algorithms, a similarly clear understanding is currently lacking. We examine the search behavior of greedy best-first search (GBFS) in order to make progress towards such an understanding. We introduce the concept of high-water mark benches, which separate the search space into areas that are searched by a GBFS algorithm in sequence. High-water mark benches allow us to exactly determine the set of states that are expanded by at least one GBFS tie-breaking strategy and give us a clearer understanding of search progress

Allocation of dump load in islanded microgrid using the mixed-integer distributed ant colony optimization with robust backward\forward sweep load flow

This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University LondonReliable planning and operation of droop-controlled islanded microgrids (DCIMGs) is fundamental to expand microgrids (MGs) scalability and maximize renewable energy potential. Employing dump loads (DLs) is a promising solution to absorb excess generation during off-peak hours while keeping voltage and frequency within acceptable limits to meet international standards. Considering wind power and demand forecast uncertainties in DCIMG during off-peak hours, the allocation of DL problem was modelled as two problems, viz., deterministic and stochastic. The former problem was tackled using four highly probable deterministic generation and demand mismatch scenarios, while the latter problem was formulated within scenario based stochastic framework for uncertainty modelling. The mixed-integer distributed ant colony optimization (MIDACO) was introduced as a novel application in microgrids to find the optimal location and size of DL as well as the optimal droop setting for distributed generation (DG). Furthermore, to enhance the convergence of the proposed optimization technique, three robust and derivative free load flow methods were developed as novel extensions of the original backward\forward sweep (BFS) for grid-connected MGs. The three load flow methods are called special BFS, improved special BFS, and general BFS. The first two methods rely on one global voltage variable distributed among all DGs, while the latter has more general approach by adopting local voltage at each generating bus. The deterministic multi-objective optimization problem was formulated to minimize voltage and frequency deviation as well as power losses. Inversely, the stochastic multi-objective problem with uncertainty was formulated to minimize total microgrid cost, maximum voltage error, frequency deviation, and total energy loss. The proposed method was applied to the IEEE 33-, 69-, and 118-test systems as modelled in MATLAB environment and further validated against competitive swarm and evolutionary metaheuristics. Various convergence tests were considered to demonstrate the efficacy of the proposed load flow methods with MIDACO’s non-dominated solution. Likewise, different optimization parameters were utilized to investigate their impact on the solution. Moreover, the advantage of multi-objective optimization against single objective was provided for the deterministic optimization problem, while the effect of load model and droop response were also investigated. The obtained results in chapter 5 and 6 further demonstrate the fundamental role of DL in voltage and frequency regulation while minimizing costs and energy losses associated with DCIMG operation. Accordingly, an improved voltage and frequency profiles for the system after DL inclusion were attained in Figure 6.9 and Figure 6.10, respectively. To demonstrate the competitiveness of DL-based energy management system (EMS) against storage-based EMS, a brief cost benefit analysis considering hot water demand was also provided

Adaptive search techniques in AI planning and heuristic search

State-space search is a common approach to solve problems appearing in artificial intelligence and other subfields of computer science. In such problems, an agent must find a sequence of actions leading from an initial state to a goal state. However, the state spaces of practical applications are often too large to explore exhaustively. Hence, heuristic functions that estimate the distance to a goal state (such as straight-line distance for navigation tasks) are used to guide the search more effectively. Heuristic search is typically viewed as a static process. The heuristic function is assumed to be unchanged throughout the search, and its resulting values are directly used for guidance without applying any further reasoning to them. Yet critical aspects of the task may only be discovered during the search, e.g., regions of the state space where the heuristic does not yield reliable values. Our work here aims to make this process more dynamic, allowing the search to adapt to such observations. One form of adaptation that we consider is online refinement of the heuristic function. We design search algorithms that detect weaknesses in the heuristic, and address them with targeted refinement operations. If the heuristic converges to perfect estimates, this results in a secondary method of progress, causing search algorithms that are otherwise incomplete to eventually find a solution. We also consider settings that inherently require adaptation: In online replanning, a plan that is being executed must be amended for changes in the environment. Similarly, in real-time search, an agent must act under strict time constraints with limited information. The search algorithms we introduce in this work share a common pattern of online adaptation, allowing them to effectively react to challenges encountered during the search. We evaluate our contributions on a wide range of standard benchmarks. Our results show that the flexibility of these algorithms makes them more robust than traditional approaches, and they often yield substantial improvements over current state-of-the-art planners.Die Zustandsraumsuche ist ein oft verwendeter Ansatz um verschiedene Probleme zu lösen, die in der Künstlichen Intelligenz und anderen Bereichen der Informatik auftreten. Dabei muss ein Akteur eine Folge von Aktionen finden, die einen Pfad von einem Startzustand zu einem Zielzustand bilden. Die Zustandsräume von praktischen Anwendungen sind häufig zu groß um sie vollständig zu durchsuchen. Aus diesem Grund leitet man die Suche mit Heuristiken, die die Distanz zu einem Zielzustand abschätzen; zum Beispiel lässt sich die Luftliniendistanz als Heuristik für Navigationsprobleme einsetzen. Heuristische Suche wird typischerweise als statischer Prozess angesehen. Man nimmt an, dass die Heuristik während der Suche eine unveränderte Funktion ist, und die resultierenden Werte werden direkt zur Leitung der Suche benutzt ohne weitere Logik darauf anzuwenden. Jedoch könnten kritische Aspekte des Problems erst im Laufe der Suche erkannt werden, wie zum Beispiel Bereiche des Zustandsraums in denen die Heuristik keine verlässlichen Abschätzungen liefert. In dieser Arbeit wird der Suchprozess dynamischer gestaltet und der Suche ermöglicht sich solchen Beobachtungen anzupassen. Eine Art dieser Anpassung ist die Onlineverbesserung der Heuristik. Es werden Suchalgorithmen entwickelt, die Schwächen in der Heuristik erkennen und mit gezielten Verbesserungsoperationen beheben. Wenn die Heuristik zu perfekten Werten konvergiert ergibt sich daraus eine zusätzliche Form von Fortschritt, wodurch auch Suchalgorithmen, die sonst unvollständig sind, garantiert irgendwann eine Lösung finden werden. Es werden auch Szenarien betrachtet, die schon von sich aus Anpassung erfordern: In der Onlineumplanung muss ein Plan, der gerade ausgeführt wird, auf Änderungen in der Umgebung angepasst werden. Ähnlich dazu muss sich ein Akteur in der Echtzeitsuche unter strengen Zeitauflagen und mit eingeschränkten Informationen bewegen. Die Suchalgorithmen, die in dieser Arbeit eingeführt werden, folgen einem gemeinsamen Muster von Onlineanpassung, was ihnen ermöglicht effektiv auf Herausforderungen zu reagieren die im Verlauf der Suche aufkommen. Diese Ansätze werden auf einer breiten Reihe von Benchmarks ausgewertet. Die Ergebnisse zeigen, dass die Flexibilität dieser Algorithmen zu erhöhter Zuverlässigkeit im Vergleich zu traditionellen Ansätzen führt, und es werden oft deutliche Verbesserungen gegenüber modernen Planungssystemen erzielt.DFG grant 389792660 as part of TRR 248 – CPEC (see https://perspicuous-computing.science), and DFG grant HO 2169/5-1, "Critically Constrained Planning via Partial Delete Relaxation

Design of a strategy to obtain safe paths from collaborative robot teamwork

Documento en PDF a color.figuras, tablasThis doctoral thesis was designed and implemented using a strategy of explorer agents and a management and monitoring system to obtain the shortest and safest paths. The strategy was simulated using Matlab R2016 in 10 test environments. The comparisons were made between the results obtained by considering each robot's work and contrasting it with the results obtained by implementing the cooperative-collaborative strategy. For this purpose, were used two path planning algorithms, they are the A* and the Greedy Best First Search (GBFS). Some changes were made to these classic algorithms to improve their performance to guarantee interactions and comparisons between them, transforming them into Incremental Heuristic (IH) algorithms, which gave rise to a couple of agents with new path planners called IH-A* and IH-GBFS. The cooperative strategy was implemented with IH-A* and IH-GBFS algorithms to obtain the shortest paths. The cooperative process was used 300 times in 100 complete tests (3 times in 10 tests in each of 10 environments), which allowed determining that the strategy decreased the original path (without cooperation) in 79% of the cases. In 20.50% of cases, the author identified that the cooperative process, reduced to less than half the original path. The collaborative strategy was implemented to obtain the safer path, using a communications system that allows the interaction among the explorer agents, the test environment, and the management and monitoring system to generate early warnings and compare the risk between paths. In this work, the risk is due to hidden marks found by the explorer agents; for this reason, it is implemented a potential risk function that allows obtaining the path risk estimated. The path risk estimated metric is the one that facilitates the evaluation and comparison of risk between paths to find safer paths. The AWMRs operates using a kinematic model, a controller, a path planner, and sensors that allow them to navigate through the environment gently and safely. Simultaneously with the explorer agents, the administration and monitoring system as a user interface that facilitates the presentation and consolidation of results were implemented. Subsequently, 16 tests were carried out, implementing the complete cooperative-collaborative strategy in four different environments, which had hidden marks. When analyzing the results, it was determined that the Shortest Safest Estimated Path was found in 62.5% of the tests. A WMR and a square test stage were built. In the test scenario, 240 path tracking tests were carried out (the WMR travelled 24 different paths; the WMR travelled each path ten times). The path data were obtained using odometry with encoders onboard the robot and image processing through an external camera. The author apply a tracking error analysis on the WMR path, travelling a circumference of 3.64 m in length. When comparing the path obtained with the WMR kinematic model with the data obtained using image processing, a Mean Absolute Percentage Error (MAPE) of 2,807% was obtained; and with the odometry data, the MAPE was 1,224%. As a general conclusion, this study has numerically identified the relevance of the implementation of the cooperative-collaborative strategy in robotic teamwork to find shortest and safest paths, a strategy applied in test environments that have obstacles and hidden marks. The cooperative-collaborative strategy can be used in different applications that involve displacement in a dangerous place or environment, such as a minefield or a region at risk of spreading COVID-19.Esta tesis doctoral fue diseñada e implementada utilizando una estrategia de agentes exploradores y un sistema de gestión y seguimiento para obtener caminos más cortos y seguros. La estrategia se simuló utilizando Matlab R2016 en 10 entornos de prueba. Las comparaciones se realizaron entre los resultados obtenidos al considerar el trabajo realizado por cada robot y contrastarlo con los resultados obtenidos al implementar la estrategia cooperativa-colaborativa. Para ello, se utilizaron dos algoritmos de planificación de rutas, que son el A* y el Greedy Best First Search (GBFS). Se realizaron algunos cambios a estos algoritmos clásicos para mejorar su rendimiento para garantizar interacciones y comparaciones entre ellos, transformándolos en algoritmos Heurísticos Incrementales (IH), lo que dio lugar a un par de agentes con nuevos planificadores de rutas denominados IH-A * e IH- GBFS. La estrategia cooperativa se implementó con algoritmos IH-A * e IH-GBFS para obtener los caminos más cortos. El proceso cooperativo se utilizó 300 veces en 100 pruebas completas (3 veces en 10 pruebas en cada uno de los 10 entornos), lo que permitió determinar que la estrategia disminuyó la trayectoria original (sin cooperación) en el 79% de los casos. En el 20,50% de los casos, el autor identificó que el proceso cooperativo, redujo la distancia entre inicio y meta a menos de la mitad del recorrido original. La estrategia colaborativa se implementó para obtener el camino más seguro, utilizando un sistema de comunicaciones que permite la interacción entre los agentes exploradores, el entorno de prueba y el sistema de gestión y monitoreo para generar alertas tempranas y comparar el riesgo entre caminos. En este trabajo, el riesgo se debe a las marcas ocultas encontradas por los agentes exploradores; por ello, se implementa una función de riesgo potencial que permite obtener el riesgo de ruta estimado. La métrica estimada de riesgo de ruta es la que facilita la evaluación y comparación de riesgo entre rutas para encontrar rutas más seguras. Los robots autónomos móviles con ruedas (en inglés AWMR) operan utilizando un modelo cinemático, un controlador, un planificador de rutas y sensores que les permiten navegar por el entorno de manera suave y segura. Simultáneamente con los agentes exploradores, el autor implementó un sistema de administración y monitoreo como interfaz de usuario que facilita la presentación y consolidación de resultados. Posteriormente, se realizaron 16 pruebas, implementando la estrategia cooperativa-colaborativa completa en cuatro entornos diferentes, que tenían marcas ocultas. Al analizar los resultados, se determinó que una ruta estimada más corta y más segura se obtenía en el 62.5% de las pruebas. Se construyeron un WMR y un escenario de prueba cuadrado. En el escenario de prueba, se llevaron a cabo 240 pruebas de seguimiento de ruta (el WMR recorrió 24 rutas diferentes; el WMR recorrió cada ruta diez veces). Los datos de la trayectoria se obtuvieron utilizando odometría con encoders a bordo del robot y procesamiento de imágenes a través de una cámara externa. El autor aplica un análisis de error de seguimiento en la ruta recorrida por el WMR, generando una circunferencia de 3,64 m de longitud. Al comparar la ruta obtenida con el modelo cinemático del WMR con los datos obtenidos usando el procesamiento de imágenesse obtuvo un error de porcentaje absoluto medio (MAPE) de 2.807%; y con los datos de odometría, el MAPE fue de 1,224%. Como conclusión general, este estudio ha identificado numéricamente la relevancia de la implementación de la estrategia cooperativa-colaborativa en el trabajo en equipo robótico para encontrar caminos más cortos y seguros, estrategia aplicada en entornos de prueba que poseen obstáculos y marcas ocultas. La estrategia cooperativa-colaborativa puede ser utilizada en diferentes aplicaciones que involucran el desplazamiento en un lugar o entorno peligroso, como pueden ser un campo minado o una región en riesgo de propagación de COVID-19.DoctoradoDoctor en Ingeniería - Ingeniería Automátic

Bicycle Sharing Systems: Fast and Slow Urban Mobility Dynamics

In cities all around the world, new forms of urban micromobility have observed rapid and wide-scale adoption due to their benefits as a shared mode that are environmentally friendly, convenient and accessible. Bicycle sharing systems are the most established among these modes, facilitating complete end-to-end journeys as well as forming a solution for the first/last mile issue that public transportation users face in getting to and from transit stations. They mark the beginnings of a gradual transition towards a more sustainable transportation model that include greater use of shared and active modes. As such, understanding the way in which these systems are used is essential in order to improve their management and efficiency. Given the lack of operator published data, this thesis aims to explore the utility of open bicycle sharing system data standards that are intended for real-time dissemination of bicycle locations in uncovering novel insights into their activity dynamics over varying temporal and geographical scales. The thesis starts by exploring bicycle sharing systems at a global-scale, uncovering their long-term growth and evolution through the development of data cleaning and metric creation heuristics that also form the foundations of the most comprehensive classification of systems. Having established the values of these metrics in conducting comparisons at scale, the thesis then analyses the medium-term impacts of mobility interventions in the context of the COVID-19 pandemic, employing spatio-temporal and network analysis methods that highlight their adaptability and resilience. Finally, the thesis closes with the analysis of granular spatial and temporal dynamics within a dockless system in London that enable the identification of the variations in journey locations throughout different times of the day. In each of these cases, the research highlights the indispensable value of open data and the important role that bicycle sharing systems play in urban mobility

Search behavior of greedy best-first search

Greedy best-first search (GBFS) is a sibling of A* in the family of best-first state-space search algorithms. While A* is guaranteed to find optimal solutions of search problems, GBFS does not provide any guarantees but typically finds satisficing solutions more quickly than A*. A classical result of optimal best-first search shows that A* with an admissible and consistent heuristic expands every state whose f-value is below the optimal solution cost and no state whose f-value is above the optimal solution cost. Theoretical results of this kind are useful for the analysis of heuristics in different search domains and for the improvement of algorithms. For satisficing algorithms, a similarly clear understanding is currently lacking. We examine the search behavior of GBFS in order to make progress towards such an understanding. We introduce the concept of high-water mark benches, which separate the search space into areas that are searched by GBFS in sequence. High-water mark benches allow us to exactly determine the set of states that GBFS expands under at least one tie-breaking strategy. We show that benches contain craters. Once GBFS enters a crater, it has to expand every state in the crater before being able to escape. Benches and craters allow us to characterize the best-case and worst-case behavior of GBFS in given search instances. We show that computing the best-case or worst-case behavior of GBFS is NP-complete in general but can be computed in polynomial time for undirected state spaces. We present algorithms for extracting the set of states that GBFS potentially expands and for computing the best-case and worst-case behavior. We use the algorithms to analyze GBFS on benchmark tasks from planning competitions under a state-of-the-art heuristic. Experimental results reveal interesting characteristics of the heuristic on the given tasks and demonstrate the importance of tie-breaking in GBFS

Sustainable Structural Design for High-Performance Buildings and Infrastructures

Exceptional design loads on buildings and structures may have different causes, including high-strain natural hazards, man-made attacks and accidents, and extreme operational conditions. All of these aspects can be critical for specific structural typologies and/or materials that are particularly sensitive. Dedicated and refined methods are thus required for design, analysis, and maintenance under structures’ expected lifetimes. Major challenges are related to the structural typology and material properties. Further issues are related to the need for the mitigation or retrofitting of existing structures, or from the optimal and safe design of innovative materials/systems. Finally, in some cases, no design recommendations are available, and thus experimental investigations can have a key role in the overall process. For this SI, we have invited scientists to focus on the recent advancements and trends in the sustainable design of high-performance buildings and structures. Special attention has been given to materials and systems, but also to buildings and infrastructures that can be subjected to extreme design loads. This can be the case of exceptional natural events or unfavorable ambient conditions. The assessment of hazard and risk associated with structures and civil infrastructure systems is important for the preservation and protection of built environments. New procedures, methods, and more precise rules for safety design and the protection of sustainable structures are, however, needed