Emmanouil Rigas

Dr. Emmanouil Rigas


Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 May 2019 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
AKAlexandros-Michail Koufakis
Alexandros-Michail Koufakis
EREmmanouil S. Rigas
Emmanouil S. Rigas
Nick BassiliadesNick Bassiliades
Nick Bassiliades
SRSarvapali D. Ramchurn
Sarvapali D. Ramchurn
We propose offline and online scheduling algorithms for the charging of electric vehicles (EVs) in a single charging station (CS). The station has available cheaper, but limited, energy from renewable energy sources (RES). The EVs are capable of and willing to participate in vehicle-to-vehicle (V2V) energy transfers that are used to reduce the charging cost and increase the RES utilization. The algorithms are centralized and aim to minimize the total charging cost for the EVs. We formulate the problem as a mixed integer programming (MIP) one and we solve it optimally assuming full knowledge of the EV demand and energy generation. Later, we propose an online algorithm that iteratively calls the offline one and copes with unknown future interruptions by arriving the EVs and with the inability to predict accurately RES production. In addition, a novel technique called virtual demand is developed that increases the demand of already existing EVs, in order to store renewable energy and later transfer it via V2V to EVs that will arrive at the CS in the future. This technique is used for mitigating the inefficiency due to the uncertainty about future actions that real-time scheduling entails. In a setting with up to 150 EVs and using real data regarding the RES production, our algorithms are shown to have low execution times, while the use of virtual demand increases RES utilization by 12% and reduces cost by 3.3%.

31 December 2021 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
EREmmanouil S. Rigas
Emmanouil S. Rigas
PKPanayiotis Kolios
Panayiotis Kolios
MMMichalis Mavrovouniotis
Michalis Mavrovouniotis
GEGeorgios Ellinas
Georgios Ellinas
In this work, the travel path of a set of drones is scheduled across a graph, where the nodes need to be visited multiple times at pre-defined points in time. The nodes can either be demand nodes requesting monitoring, or supply nodes that are used as take-off/landing locations for the drones and for battery replacement to cope with the limited flying range of the drones. This is an extension of the well-known multiple traveling salesman problem and the proposed formulation can be applied in several domains such as the monitoring of traffic flows in a transportation network, the monitoring of remote locations to assist search and rescue missions, or the monitoring of critical infrastructure facilities for security and surveillance purposes. Aiming to find the optimal schedule, the problem is initially formulated as an Integer Linear Program (ILP). However, given that the problem is highly combinatorial, the optimal solution scales only for small-size problems. Thus, a greedy algorithm is also proposed that uses a one-step look-ahead heuristic search mechanism, as well as an algorithm that is based on ant colony optimization (ACO). In a detailed evaluation, it is observed that both algorithms achieve near-optimal performance for small settings, while also scaling to larger settings, with the ACO being more suitable for medium-size settings and the Greedy for larger ones. A field experiment is additionally performed to demonstrate the practical implementation of the proposed system under real-world conditions.

16 May 2024 in Journal of Systems and Software
Verified
Journal Article
Open access
EREmmanouil S. Rigas
Emmanouil S. Rigas
PLParis Lagakis
Paris Lagakis
MKMakis Karadimas
Makis Karadimas
ELEvangelos Logaras
Evangelos Logaras
DLDimitra Latsou
Dimitra Latsou
PANAGIOTIS BAMIDISPANAGIOTIS BAMIDIS
PANAGIOTIS BAMIDIS

18 May 2023
Verified
Book Chapter
Open access
PDF file
IKIlias Kyparissidis Kokkinidis
Ilias Kyparissidis Kokkinidis
ELEvangelos Logaras
Evangelos Logaras
EREmmanouil S. Rigas
Emmanouil S. Rigas
Ioannis TsakiridisIoannis Tsakiridis
Ioannis Tsakiridis
Themistoklis DagklisThemistoklis Dagklis
Themistoklis Dagklis
PANAGIOTIS BAMIDISPANAGIOTIS BAMIDIS
PANAGIOTIS BAMIDIS
Preterm birth (PTB) is defined as delivery occurring before 37 weeks of gestation. In this paper, Artificial Intelligence (AI)-based predictive models are adapted to accurately estimate the probability of PTB. In doing so, pregnant women’ objective results and variables extracted from the screening procedure in combination with demographics, medical history, social history, and other medical data are used. A dataset consisting of 375 pregnant women is used and a number of alternative Machine Learning (ML) algorithms are applied to predict PTB. The ensemble voting model produced the best results across all performance metrics with an area under the curve (ROC-AUC) of approximately 0.84 and a precision–recall curve (PR-AUC) of approximately 0.73. An attempt to provide clinicians with an explanation of the prediction is performed to increase trustworthiness.

22 January 2024 in IEEE Transactions on Intelligent Vehicles
Verified
Journal Article
Closed access
EREmmanouil S. Rigas
Emmanouil S. Rigas
PKPanayiotis Kolios
Panayiotis Kolios
GEGeorgios Ellinas
Georgios Ellinas
In recent years, a revolutionary idea has been proposed to leverage the third dimension and dramatically transform urban transportation. The concept of Urban Air Mobility (UAM) involves Aerial Vehicles (AVs), piloted by humans or flying autonomously, that can transport commuters across pairs of locations devoted to takeoff and landing. The scheduling of such vehicles, aiming for the maximization of the number of commuters serviced by AVs, is a challenging problem. This work initially formulates the AV scheduling problem in a UAM-based scheme using Integer Linear Programming (ILP) techniques, providing an offline optimal solution to this problem. As this problem is highly combinatorial, the exact solution has limited scalability and for this reason two greedy algorithms are also developed, that perform near-optimally with considerably lower execution times. The first heuristic algorithm calls and solves the ILP incrementally for each vehicle, while the second heuristic relies on a look-ahead search approach. The algorithms are then extended to support vehicle relocation in order to increase the travel requests that are serviced. All algorithms are evaluated in a number of realistic scenarios to verify their performance and demonstrate their applicability.

1 September 2014
Verified
Conference Paper
Closed access
Thanos StavropoulosThanos Stavropoulos
Thanos Stavropoulos
EREmmanouil S. Rigas
Emmanouil S. Rigas
EKEfstratios Kontopoulos
Efstratios Kontopoulos
Nick BassiliadesNick Bassiliades
Nick Bassiliades
IVIoannis Vlahavas
Ioannis Vlahavas
This paper presents a novel energy management framework for multi-agent coordination in smart buildings. The framework builds on top of an existing Service-Oriented middleware for Ambient Intelligence, which offers sensor and actuator functions of wireless devices. The middleware also provides a semantics infrastructure that assists in authoring agent policies for reducing energy consumption and maximizing user comfort. Each agent within the framework is responsible for monitoring the environmental context and controlling the electrical appliances of a specific room. However, the collective behavior of the multi-agent system is controlled by a Coordinator Agent that approves or rejects the allocation of building resources in time, aiming at more "long-term" goals that are out of the reach and scope of the individual Room Agents. The agents' underlying logic is expressed via defeasible logics, a formalism offering intuitive knowledge representation and advanced conflict resolution mechanisms.