For Admissions Enquire: 8712225044 | admissions@aceec.ac.in
Assistant Professor
Qualification:
B. Com (Computers), M. Tech (CSE), (PhD – CSE)
Professional Exp.:
15 Years
Registration Number:
0389-210921-192038
I am a Computer Science & Engineering faculty with more than 10 years of experience at the University, College, and Corporate Institute levels. As being an academician only teaching is less fruitful without research. I got deep interest in research since my graduation time. My objective as a Faculty is to teach both theoretical and practical course content to the students in class/lab session, preparing instructions and planning of sessions, assessing student’s assignments and examinations. My commitment and approach towards teaching, programming and research have been rewarded with the highest applause in my past workplaces. I have remarkable programming skills, during my work period as Adjacent Faculty at Henan University of Economics and Law (HUEL) – RPC, Research Assistant at Charles University (Univerzita Karlova), completed the development of research project using java programming and implemented various Artificial Intelligent Agents for various games using AI techniques using Python. While working at University of Nizwa (Nizwa, Oman) as a lecturer, I have developed various web applications as well as portals using PHP for the University. Besides that, I have published a handsome number of articles in well-reputed journals.
(PhD Focus): “ACBS: A Bounded Sub-Optimal Multi-Agent Pathfinding Solver For Search-Based Problems”. The problem of Multi-Agent Pathfinding (MAPF) is an instance of multi-agent planning and consists in the computation of collision-free paths for a group of agents from their location to an assigned target. It is an optimization problem, since the aim is to find those paths that optimize a given objective function, usually defined as the number of time steps until all agents reach their goal cells. MAPF is the multi-agent generalization of the path finding problem, and it is closely related to the shortest path problem in the context of graph theory.
SCIENTIFICMEMBERSHIPS