Morteza Ebrahimi
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
Morteza Ebrahimi has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Ahmad Foroozani
Department of Network Science and Technology, Faculty of New Science and Technologies, University of Tehran, North Kargar Street, Tehran, Iran
2 shared publications - Razieh Abdollahi
Faculty of New Sciences and Technologies, University of Tehran, Tehran, Iran
2 shared publications - Sama Goliaei
Faculty of New Sciences and Technologies University of Tehran Tehran Iran
2 shared publications - Zahra Razaghi-Moghadam
University of Tehran
2 shared publications A.G. Mahmeiani
Islamic Azad University, Ali Abad Katoul Branch, Ali Abad Katoul, Iran
1 shared publication- Ahmad Neirameh
Department of Mathematics, Faculty of Sciences, Gonbad Kavous University, Gonbad, Iran
1 shared publication
Latest Publications
- Open Access
- 6 August 2026
- Published by MDPI AG in Algorithms
- Vol. 19 (8) , 652
Wind-Aware RRT* with Neural Energy Refinement for Energy-Efficient Urban Air Mobility
Urban air mobility depends on small aerial vehicles threading through dense, wind-swept cities, yet most sampling-based planners treat the urban wind field as noise to reject rather than structure to exploit—and pay for it in flight energy. We take the opposite view. Behind every building lies a sheltered wake where the air slows and aerodynamic drag drops, and this work turns that physical fact into a planning principle. We present an energy-aware, wind-shadow-aware framework that routes a single quadrotor, at the planning level, through these low-wind corridors. The wind model couples a power-law shear profile with Ekman directional veer and a frozen-turbulence gust component, grounding the planner in realistic boundary-layer physics. A feed-forward neural energy surrogate, trained to approximate a cost field that aggregates wind exposure and obstacle clearance, then guides a two-stage refinement—energy-aware, collision-checked shortcutting followed by Laplacian and energy-guided smoothing—so that every accepted change stays collision-free. Against classical sampling-based baselines (RRT, goal-biased RRT, Informed RRT*, and BIT*) over a 50-run Monte-Carlo study, evaluated with multi-criteria metrics and Pareto-dominance analysis, the framework characterizes how wind-shadow-aware routing balances route energy against smoothness and clearance, offering a reproducible, wind-informed basis for flying robots navigation.
- 6 August 2026
- Published by MDPI AG in Algorithms
- Vol. 19 (8) , 652
Open AccessWind-Aware RRT* with Neural Energy Refinement for Energy-Efficient Urban Air Mobility
Urban air mobility depends on small aerial vehicles threading through dense, wind-swept cities, yet most sampling-based planners treat the urban wind field as noise to reject rather than structure to exploit—and pay for it in flight energy. We take the opposite view. Behind every building lies a sheltered wake where the air slows and aerodynamic drag drops, and this work turns that physical fact into a planning principle. We present an energy-aware, wind-shadow-aware framework that routes a single quadrotor, at the planning level, through these low-wind corridors. The wind model couples a power-law shear profile with Ekman directional veer and a frozen-turbulence gust component, grounding the planner in realistic boundary-layer physics. A feed-forward neural energy surrogate, trained to approximate a cost field that aggregates wind exposure and obstacle clearance, then guides a two-stage refinement—energy-aware, collision-checked shortcutting followed by Laplacian and energy-guided smoothing—so that every accepted change stays collision-free. Against classical sampling-based baselines (RRT, goal-biased RRT, Informed RRT*, and BIT*) over a 50-run Monte-Carlo study, evaluated with multi-criteria metrics and Pareto-dominance analysis, the framework characterizes how wind-shadow-aware routing balances route energy against smoothness and clearance, offering a reproducible, wind-informed basis for flying robots navigation.
- 20 July 2026
- Published by Springer Nature in Signal, Image and Video Processing
- Vol. 20 (9) , 508
Knowledge-distilled lightweight transformers for multi-label chest X-ray detection
- 20 July 2026
- Published by Springer Nature in Signal, Image and Video Processing
- Vol. 20 (9) , 508
Knowledge-distilled lightweight transformers for multi-label chest X-ray detection
- 19 March 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 249
Guards: Benchmarks for weighted grid-based pathfinding
- 19 March 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 249
Guards: Benchmarks for weighted grid-based pathfinding
- 13 December 2023
- Published by Elsevier in Neurocomputing
- Vol. 573
STAR: A session-based time-aware recommender system
- 13 December 2023
- Published by Elsevier in Neurocomputing
- Vol. 573
STAR: A session-based time-aware recommender system
- Open Access
- 26 June 2023
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 37 (10) , 12373-12380
Optimal Pathfinding on Weighted Grid Maps
In many computer games up to hundreds of agents navigate in real-time across a dynamically changing weighted grid map. Pathfinding in these situations is challenging because the grids are large, traversal costs are not uniform, and because each shortest path has many symmetric permutations, all of which must be considered by an optimal online search. In this work we introduce Weighted Jump Point Search (JPSW), a new type of pathfinding algorithm which breaks weighted grid symmetries by introducing a tiebreaking policy that allows us to apply effective pruning rules in symmetric regions. We show that these pruning rules preserve at least one optimal path to every grid cell and that their application can yield large performance improvements for optimal pathfinding. We give a complete theoretical description of the new algorithm, including pseudo-code. We also conduct a wide-ranging experimental evaluation, including data from real games. Results indicate JPSW is up to orders of magnitude faster than the nearest baseline, online search using A*.
- 26 June 2023
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 37 (10) , 12373-12380
Open AccessOptimal Pathfinding on Weighted Grid Maps
In many computer games up to hundreds of agents navigate in real-time across a dynamically changing weighted grid map. Pathfinding in these situations is challenging because the grids are large, traversal costs are not uniform, and because each shortest path has many symmetric permutations, all of which must be considered by an optimal online search. In this work we introduce Weighted Jump Point Search (JPSW), a new type of pathfinding algorithm which breaks weighted grid symmetries by introducing a tiebreaking policy that allows us to apply effective pruning rules in symmetric regions. We show that these pruning rules preserve at least one optimal path to every grid cell and that their application can yield large performance improvements for optimal pathfinding. We give a complete theoretical description of the new algorithm, including pseudo-code. We also conduct a wide-ranging experimental evaluation, including data from real games. Results indicate JPSW is up to orders of magnitude faster than the nearest baseline, online search using A*.
- 13 June 2022
- Published by Maximum Academic Press in The Knowledge Engineering Review
- Vol. 37
An online scalarization multi-objective reinforcement learning algorithm: TOPSIS Q-learning
Conventional reinforcement learning focuses on problems with single objective. However, many problems have multiple objectives or criteria that may be independent, related, or contradictory. In such cases, multi-objective reinforcement learning is used to propose a compromise among the solutions to balance the objectives. TOPSIS is a multi-criteria decision method that selects the alternative with minimum distance from the positive ideal solution and the maximum distance from the negative ideal solution, so it can be used effectively in the decision-making process to select the next action. In this research a single-policy algorithm called TOPSIS Q-Learning is provided with focus on its performance in online mode. Unlike all single-policy methods, in the first version of the algorithm, there is no need for the user to specify the weights of the objectives. The user’s preferences may not be completely definite, so all weight preferences are combined together as decision criteria and a solution is generated by considering all these preferences at once and user can model the uncertainty and weight changes of objectives around their specified preferences of objectives. If the user only wants to apply the algorithm for a specific set of weights the second version of the algorithm efficiently accomplishes that.
- 13 June 2022
- Published by Maximum Academic Press in The Knowledge Engineering Review
- Vol. 37
An online scalarization multi-objective reinforcement learning algorithm: TOPSIS Q-learning
Conventional reinforcement learning focuses on problems with single objective. However, many problems have multiple objectives or criteria that may be independent, related, or contradictory. In such cases, multi-objective reinforcement learning is used to propose a compromise among the solutions to balance the objectives. TOPSIS is a multi-criteria decision method that selects the alternative with minimum distance from the positive ideal solution and the maximum distance from the negative ideal solution, so it can be used effectively in the decision-making process to select the next action. In this research a single-policy algorithm called TOPSIS Q-Learning is provided with focus on its performance in online mode. Unlike all single-policy methods, in the first version of the algorithm, there is no need for the user to specify the weights of the objectives. The user’s preferences may not be completely definite, so all weight preferences are combined together as decision criteria and a solution is generated by considering all these preferences at once and user can model the uncertainty and weight changes of objectives around their specified preferences of objectives. If the user only wants to apply the algorithm for a specific set of weights the second version of the algorithm efficiently accomplishes that.
- Open Access
- 1 January 2022
- Published by Elsevier in SSRN Electronic Journal
Molecular Communications Based on in Vitro Biological Experiments in Terms of Laboratory Data
Molecular communications is a vast and expanding research field. Recent advancements in biology have encouraged the use of bacteria which are genetically engineered as a significant factor in molecular communications. It is stimulated new research which tries to study molecular communications between bacteria from a theoretical information viewpoint. Because of the high randomness existing in the behavior of each bacteria, establishing a reliable communication between bacteria is nearly impossible. Thus, considering the tiny size and scale of these devices and cells, using conventional waves in communication is complex, and for high-frequency guidance systems have low efficiency, new methods and models must be designed. In this paper, the networking of bacterium colonies with molecular communications, on two bacteria with chrome sensing properties, Vibrio Fischeri and Vibrio Harveyi are practically implemented. Also, the validity of presented models is studied and tested empirically in the real laboratory environment. In the form of empirical laboratories in terms of information transmission in practical signaling, reliability, and delay on molecular communication lines, are cluttering in the uniform distributed network. The effects of noise in the molecular communication network on message and information transmission are measured. Finally, the obtained results are presented and compared to previously presented theoretical models, The numerical value of the diffusion coefficient for the bacteria is calculated and shows that the value of the mathematical model has an error compared to the actual experiment. Although this error rate is significant, it is worth noting that the general trend of experiments and simulations is the same.
- 1 January 2022
- Published by Elsevier in SSRN Electronic Journal
Open AccessMolecular Communications Based on in Vitro Biological Experiments in Terms of Laboratory Data
Molecular communications is a vast and expanding research field. Recent advancements in biology have encouraged the use of bacteria which are genetically engineered as a significant factor in molecular communications. It is stimulated new research which tries to study molecular communications between bacteria from a theoretical information viewpoint. Because of the high randomness existing in the behavior of each bacteria, establishing a reliable communication between bacteria is nearly impossible. Thus, considering the tiny size and scale of these devices and cells, using conventional waves in communication is complex, and for high-frequency guidance systems have low efficiency, new methods and models must be designed. In this paper, the networking of bacterium colonies with molecular communications, on two bacteria with chrome sensing properties, Vibrio Fischeri and Vibrio Harveyi are practically implemented. Also, the validity of presented models is studied and tested empirically in the real laboratory environment. In the form of empirical laboratories in terms of information transmission in practical signaling, reliability, and delay on molecular communication lines, are cluttering in the uniform distributed network. The effects of noise in the molecular communication network on message and information transmission are measured. Finally, the obtained results are presented and compared to previously presented theoretical models, The numerical value of the diffusion coefficient for the bacteria is calculated and shows that the value of the mathematical model has an error compared to the actual experiment. Although this error rate is significant, it is worth noting that the general trend of experiments and simulations is the same.
- 1 December 2021
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 103
Nonlinear anomalous information diffusion model in social networks
- 1 December 2021
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 103
Nonlinear anomalous information diffusion model in social networks
- 29 May 2019
- Published by Elsevier in Expert Systems with Applications
- Vol. 134, 249-266
Anomalous information diffusion in social networks: Twitter and Digg
- 29 May 2019
- Published by Elsevier in Expert Systems with Applications
- Vol. 134, 249-266
Anomalous information diffusion in social networks: Twitter and Digg