Sort by
Requirements on Interpretation Tools for AI Systems
Stefan Haufe
Posted: 06 March 2025
Geometric Properties of a General Kohn-Nirenberg Domain in $\mathbb{C}^{n}$
Kejia Hu,
Hongyi Li,
Di Zhao,
Yuan Jiang,
Baozhu Li
Posted: 06 March 2025
A New Semi-Local Centrality with Weighted Lexicographic Extended Neighborhood (SL-WLEN) for Identifying Influential Nodes: Validation in Quality Control Networks
Maricela Fernanda Ormaza Morejón,
Rolando Ismael Yépez Moreira
Posted: 06 March 2025
Comparing Traditional Machine Learning and Advanced Gradient Boosting Techniques in Customer Churn Prediction: A Telecom Industry Case Study
Mehdi Imani
Posted: 06 March 2025
Demonstration the Importance of Pre‐processing the Text Fields of Bibliometric Records to Identify Promising Research Tasks. Case Study of Scopus Data on Petroleum Reservoir Engineering
Boris Chigarev
Posted: 06 March 2025
Future Outdoor Safety Monitoring: Integrating Human Activity Recognition with the Internet of Physical-Virtual Things
Yu Chen,
Jia Li,
Erik Blasch,
Qian Qu
Posted: 06 March 2025
Combining Statistical and Machine Learning Methodologies in Energy Consumption Forecasting for Electric Vehicles
Vasileios Pitsiavas,
Georgios Spanos,
Sofia Polymeni,
Antonios Lalas,
Konstantinos Votis,
Dimitrios Tzovaras
Posted: 06 March 2025
A Hybrid Evolutionary Fuzzy Ensemble Approach for Accurate Software Defect Prediction
Raghunath Dey,
Jayashree Piri,
Biswaranjan Acharya,
Pragyan Paramita Das,
Vassilis C. Gerogiannis,
Andreas Kanavos
Posted: 06 March 2025
LayeredMAPF: A Decomposition of Mapf Instance to Reduce Solving Costs
Zhuo Yao
Posted: 05 March 2025
A Comprehensive Review of CAN Bus and IEEE 802.11b Networks: Evolution, Performance, and Wireless Extensions
Qutaiba Ibrahim,
Zena Ali
Posted: 05 March 2025
Revolutionizing Cardiac Risk Assessment: AI-Powered Patient Segmentation Using Advanced Machine Learning Techniques
Joan D. Gonzalez-Franco,
Alejandro Galaviz-Mosqueda,
Salvador Villarreal-Reyes,
Jose E. Lozano-Rizk,
Raul Rivera-Rodriguez,
Jose E. Gonzalez-Trejo,
Alexei-Fedorovish Licea-Navarro,
Jorge Lozoya-Arandia,
Edgar A. Ibarra-Flores
Posted: 05 March 2025
Practical Realization of Reactive Jamming Attack on LoRaWAN Network
Josip Sabic,
Toni Perković,
Dinko Begušić,
Petar Šolić
Posted: 05 March 2025
High-Frequency Cryptocurrency Price Forecasting using Machine Learning Models: A Comparative Study
Fátima Rodrigues,
Miguel Machado
Posted: 05 March 2025
Machine Learning Techniques for Fake News Detection
Eunice Oyedokun,
Barnty William
Posted: 05 March 2025
DualCascadeTSF-MobileNetV2: A Lightweight Violence Behavior Recognition Model
Yuang Chen,
Yong Li,
Shaohua Li,
Shuhan Lv,
Fang Lin
Posted: 05 March 2025
Mathematical Modeling of the Evolution of Complex Networks
Felix Sadyrbaev
Posted: 05 March 2025
GenXSS: an AI-Driven Framework for Automated Detection of XSS Attacks in WAFs
Vahid Babaey,
Arun Ravindran
Posted: 05 March 2025
Deep Reinforcement Learning Based Coverage Path Planning in Unknown Environments
Tianyao Zheng,
Yuhui Jin,
Haopeng Zhao,
Zhichao Ma,
Yongzhou Chen,
Kunpeng Xu
The Twin Delayed Deep Deterministic Policy Gradient (TD3) algorithm offers a robust solution for the coverage path planning problem, where a robot must effectively and efficiently cover a designated area, ensuring minimal redundancy and maximum coverage. Traditional methods for path planning often lack the adaptability required for dynamic and unstructured environments. In contrast, TD3 utilizes twin Q-networks to reduce overestimation bias, delayed policy updates for increased stability, and target policy smoothing to maintain smooth transitions in the robot's path. These features allow the robot to learn an optimal path strategy in real-time, effectively balancing exploration and exploitation. This paper explores the application of TD3 to coverage path planning, demonstrating that it enables a robot to adaptively and efficiently navigate complex coverage tasks, showing significant advantages over conventional methods in terms of coverage rate, total length, and adaptability.
The Twin Delayed Deep Deterministic Policy Gradient (TD3) algorithm offers a robust solution for the coverage path planning problem, where a robot must effectively and efficiently cover a designated area, ensuring minimal redundancy and maximum coverage. Traditional methods for path planning often lack the adaptability required for dynamic and unstructured environments. In contrast, TD3 utilizes twin Q-networks to reduce overestimation bias, delayed policy updates for increased stability, and target policy smoothing to maintain smooth transitions in the robot's path. These features allow the robot to learn an optimal path strategy in real-time, effectively balancing exploration and exploitation. This paper explores the application of TD3 to coverage path planning, demonstrating that it enables a robot to adaptively and efficiently navigate complex coverage tasks, showing significant advantages over conventional methods in terms of coverage rate, total length, and adaptability.
Posted: 05 March 2025
A Simple Fractional Model With Complex Dynamics in the Order of the Derivative
Guillermo Fernández-Anaya,
Francisco A. Godínez,
Rogelio Valdés,
Alberto Quezada-Téllez,
Marco Polo-Labarrios
Posted: 04 March 2025
A Robust Tomato Counting Framework for Greenhouse Inspection Robots Using YOLOv8 and Inter-Frame Prediction
Wanli Zheng,
Guanglin Dai,
Miao Hu,
Pengbo Wang
Posted: 04 March 2025
of 445