Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Arsany W. Youssef has a total of 10 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Multi-Agent Cooperative Decision-Making for Connected and Automated Vehicles: A Survey of Methods, Scenarios, and Deployment Challenges

    by Arsany W. Youssef, Fernando García, Abdulla Al-Kaff

    Connected and Automated Vehicles (CAVs) are expected to improve road safety and traffic efficiency, but achieving this remains challenging. This paper presents a methodologically organized survey of cooperative decision-making approaches for CAV systems, tracing their chronological development within each methodological family. The literature is categorized into rule-based and control-theoretic methods; game-theoretic models; single-agent and multi-agent reinforcement learning (MARL) approaches; and large language model (LLM)-, vision language model (VLM)-, multimodal large language model (MLLM)-, and foundation-model-based decision support. The reviewed studies address a range of traffic scenarios, including platooning, lane changes, merging, intersections, traffic signals, and mixed-traffic environments. The review compares these methods based on safety, scalability, communication requirements, interpretability, sim-to-real transfer, and mixed-traffic performance. The selected literature illustrates MARL-based approaches to cooperative CAV decision-making; its composition is not used to infer publication growth or the prevalence of methods across the field. Nevertheless, the reviewed MARL methods face challenges concerning safety, communication, scalability, interpretability, and transfer from simulation to real-world deployment. Overall, no single method addresses all the requirements of cooperative CAV systems. Hybrid architectures combining MARL with complementary methods are therefore a promising direction for future CAV systems.

  • Kinematic modeling and control of omnidirectional wheeled cellular conveyor

    by Arsany W. Youssef, Nermine M. Elhusseiny, Omar M. Shehata, Lamia A. Shihata, Eman Azab


  • Open Access

    Omnidirectional-Wheel Conveyor Path Planning and Sorting Using Reinforcement Learning Algorithms

    by Walid Zaher, Arsany W. Youssef, Lamia A. Shihata, Eman Azab, Maggie Mashaly

    In this paper, path planning and sorting of packages for Omnidirectional-Wheel conveyor are presented using Reinforcement Learning (RL). Q-learning, Double Q-learning, Deep Q-learning, and the Double Deep Q-learning algorithms are investigated. The RL algorithms enable the conveyor to self-learn the packages path and sort them without using conventional control or path planning theories. The RL algorithms are used for two different case studies on conveyors structures with different numbers of cells to compare and evaluate their performances in large- and small-scale sized structures. To explore the proposed methods response to external environment effects, two types of collisions between multiple packages were considered, the proposed RL algorithms showed their ability to resolve both types successfully. Comparative study between multiple RL algorithms for path planning showed that the Q-learning and Double Q-learning algorithms had outperformed their Deep learning versions for path planning in the two case studies. Furthermore, the proposed RL methods are compared experimentally to classic control and path planning theories using a hardware prototype for one of the presented case studies. The hardware experimental results showed that the proposed RL methods were as successful as the conventional methods in path planning and sorting in much less processing time. Two types of sorting scenarios (Type I and II) were tested for same package type and for multiple ones. For Type I sorting the Q-learning algorithm performed better than the Qlearning with weights approach, achieving better mean and minimum rewards while maximum rewards remain the same for both techniques. As for Type II sorting, only the Q-learning with weights approach was able to achieve it and converge in a reasonable time.