Browsing by Author "Ciflikli, Cebrail"

Now showing 1 - 4 of 4

An Android Application for Geolocation Based Health Monitoring, Consultancy And Alarm System
(2018) Tartan, Emre Oner; Ciflikli, Cebrail
In the last decade significant progress have been made in smart phone technology as well as in wireless wide area network technologies. Today among a wide population smart phones and mobile applications are considered as indispensable part of daily life. A field that mobile applications have great potential is health monitoring. Health monitoring covers various physiological signals. One of these signals is heart rate which is related to cardiovascular state of the body. Recently producers offer heart rate monitoring with the on board or wearable heart rate sensor. Although the main trend is for individual usage especially in sports, heart rate monitoring can also be benefited in an emergency alarm system for people who have potential risks while doing sports or elderly people. Such a distant monitoring system can be helpful to deliver first aid in emergency cases. Moreover an health expert can monitor states of the patients in real time. In this study we benefit the facilities provided by mobile technology and propose a geolocation-based heart rate monitoring system. The developed mobile application can send alarm message through notification, sms, mail and allows messaging with the health expert for consultancy. Hence if anomalies are observed in heart rate variability during the outdoor activities, emergency information can be delivered in the shortest time and the delays which have crucial affects can be prevented. The same framework can be extended to a more general system including different sensors for monitoring various physiological signals.
Elevator Parking Approach in Nearest Car Method
(2018) Ciflikli, Cebrail; Tartan, Emre Oner
A fundamental factor that determines the system efficiency and the quality of service in elevator group control systems is the used elevator dispatching algorithm. Along with the elevator dispatching algorithm, using an elevator parking algorithm can provide improvements in the performance of an elevator group control system. In this study considering a system that uses Nearest Car Method as the elevator dispatching algorithm, average passenger waiting time is investigated under different traffic conditions using three parking algorithms and when no parking algorithm is used. For a more efficient elevator control system an adaptive park algorithm which is changing according to varying traffic conditions is proposed.
A model for the visualization and analysis of elevator traffic
(2019) Ciflikli, Cebrail; Tartan, Emre Oner
Analysis of elevator traffic in high rise buildings is critical to the performance evaluation of elevator group control systems (EGCS). Elevator dispatching methods or parking algorithms in an EGCS can be designed or modified according to analyses of traffic flow. However, interpretation of traffic flow based solely on numerical data may not be explicit and transparent for EGCS experts as well as for other non-expert building administration. In this study, we present a model for visualization and analysis of elevator traffic. First, we present an alternative approach for traffic analysis which we call route visualization. In the proposed approach, we initially decompose elevator traffic into its component parts and investigate each component independently. Then, using superposition of components we obtain a reconstructed model of overall traffic. This modeling approach provides component-based traffic analysis and representation of routes with intensities through data visualization. In the second part we introduce a multi-dimensional analysis of time parameters in ECGS. This approach provides a comparative analysis of several control algorithms such as dispatch or park algorithms for different combinations of traffic components.
Sequential Decision Making for Elevator Control
(2023) Tartan, Emre Oner; Ciflikli, Cebrail; 0000-0002-5688-4226; JVD-9650-2023
In the last decade Reinforcement Learning (RL) has significantly changed the conventional control paradigm in many fields. RL approach is spreading with many applications such as autonomous driving and industry automation. Markov Decision Process (MDP) forms a mathematical idealized basis for RL if the explicit model is available. Dynamic programming allows to find an optimal policy for sequential decision making in a MDP. In this study we consider the elevator control as a sequential decision making problem, describe it as a MDP with finite state space and solve it using dynamic programming. At each decision making time step we aim to take the optimal action to minimize the total of hall call waiting times in the episodic task. We consider a sample 6-floor building and simulate the proposed method in comparison with the conventional Nearest Car Method (NCM).