IEEE

Dynamic Spanning Tree Coverage With Q-Learning: A Hybrid Framework for Efficient Robot Navigation in Environments With Moving Obstacles

Abstract: This paper presents a novel hybrid framework that combines Dynamic Spanning Tree Coverage (D-STC) with Q-learning to address the challenges of mobile robot navigation and coverage in dynamic ...
Scientific Research Publishing

The Design of the Minimum Spanning Tree Algorithms ()

Based on the graphic theory and improved genetic algorithm,an improved genetic algorithm to search the minimum spanning trees is given . The algorithm uses binary code to represent the problem of ...
IEEE

Performance Evaluation of Capacitated Minimum Spanning Tree Algorithms for Wireless Sensor Networks

Abstract: Tiny motes running on wireless sensor networks (WSNs) are equipped with limited batteries. Thus, design and implementation of energy-efficient algorithms on WSNs is vital. Problem of finding ...
GitHub

OpenASCE: A Python Package for End-to-End Large Scale Causal Learning

OpenASCE (Open All-Scale Casual Engine) is a comprehensive, easy-to-use, and efficient end-to-end large-scale causal learning system. It provides causal discovery, causal effect estimation, and ...