animesh dutta | National Institute of Technology, Durgapur (original) (raw)

Papers by animesh dutta

Proceedings of the AAAI Conference on Artificial Intelligence

In this paper, we focus on the Coalition Structure Generation (CSG) problem, which involves findi... more In this paper, we focus on the Coalition Structure Generation (CSG) problem, which involves finding exhaustive and disjoint partitions of agents such that the efficiency of the entire system is optimized. We propose an efficient hybrid algorithm for optimal coalition structure generation called BOSS. When compared to the state-of-the-art, BOSS is shown to perform better by up to 33.63% on benchmark inputs. The maximum time gain by BOSS is 3392 seconds for 27 agents.

Proceedings of the 10th International Conference on Agents and Artificial Intelligence, 2018

Dynamic Programming (DP) is an effective procedure to solve many combinatorial optimization probl... more Dynamic Programming (DP) is an effective procedure to solve many combinatorial optimization problems and optimal Coalition Structure generation (CSG) is one of them. Optimal CSG is an important combinatorial optimization problem with significant real-life applications. The current best result in terms of worst case time complexity is O(3 n). So, there is a need to find speedy approaches. This paper proposes a parallel dynamic programming algorithm for optimal CSG. We performed the comparison of our algorithm with the DP for CSG problem which happens to be a sequential procedure. The theoretical, as well as the empirical results show that our proposed method works faster than its sequential counterpart. We obtain a speed-up that is almost 14 times in case of 17 agents using a 16-core machine.

TENCON 2010 - 2010 IEEE Region 10 Conference, 2010

Teleteaching has become a major tool to impart education, where it introduces a concept of geogra... more Teleteaching has become a major tool to impart education, where it introduces a concept of geographical independence. In this paper we design an environment of a university where in all the activities can be done "online". We use ontology to design the environment by describing, structuring, defining the environment.

ArXiv, 2016

This paper addresses the issues concerning the rescheduling of a static timetable in case of a di... more This paper addresses the issues concerning the rescheduling of a static timetable in case of a disaster encountered in a large and complex railway network system. The proposed approach tries to modify the schedule so as to minimise the overall delay of trains. This is achieved by representing the rescheduling problem in the form of a Petri-Net and the highly uncertain disaster recovery times in such a model is handled as Markov Decision Processes (MDP ). For solving the rescheduling problem, a istributed Constraint Optimisation (DCOP ) based strategy involving the use of autonomous agents is used to generate the desired schedule. The proposed approach is evaluated on the actual schedule of the Eastern Railways, India by constructing vari- ous disaster scenarios using the Java Agent DEvelopment Framework (JADE). When compared to the existing approaches, the proposed framework substantially reduces the delay of trains after rescheduling.

Proceedings of the AAAI Conference on Artificial Intelligence, 2020

Coalition Structure Generation (CSG) is an NP-complete problem that remains difficult to solve on... more Coalition Structure Generation (CSG) is an NP-complete problem that remains difficult to solve on account of its complexity. In this paper, we propose an efficient hybrid algorithm for optimal coalition structure generation called ODSS. ODSS is a hybrid version of two previously established algorithms IDP (Rahwan and Jennings 2008) and IP (Rahwan et al. 2009). ODSS minimizes the overlapping between IDP and IP by dividing the whole search space of CSG into two disjoint sets of subspaces and proposes a novel subspace shrinking technique to reduce the size of the subspace searched by IP with the help of IDP. When compared to the state-of-the-art against a wide variety of value distributions, ODSS is shown to perform better by up to 54.15% on benchmark inputs.

Proceedings of the AAAI Conference on Artificial Intelligence, 2019

Optimal Coalition Structure Generation (CSG) is a significant research problem that remains diffi... more Optimal Coalition Structure Generation (CSG) is a significant research problem that remains difficult to solve. Given n agents, the ODP-IP algorithm (Michalak et al. 2016) achieves the current lowest worst-case time complexity of O(3n). We devise an Imperfect Dynamic Programming (ImDP) algorithm for CSG with runtime O(n2n). Imperfect algorithm means that there are some contrived inputs for which the algorithm fails to give the optimal result. Experimental results confirmed that ImDP algorithm performance is better for several data distribution, and for some it improves dramatically ODP-IP. For example, given 27 agents, with ImDP for agentbased uniform distribution time gain is 91% (i.e. 49 minutes).

Lecture Notes in Computer Science, 2013

Despite being one of the world's largest railways networks, with a daily transportation of over 2... more Despite being one of the world's largest railways networks, with a daily transportation of over 25 million passengers and 2.8 million tons of freight, the Indian Railways perform their signaling, traffic management and trains scheduling activities in a completely manual way. The lack of automation causes not only significant delays, but also frequent collisions where passengers die or remain seriously injured. This paper describes how we modeled the Indian Railways system as a MAS and the results of the simulations run using NetLogo on real data retrieved from the Indian Railways dataset. The simulated system isunder some assumptions-collision-free and, thanks to the integration of the MAX-SUM algorithm, minimizes the individual train delay.

Proceedings of the International Symposium on Combinatorial Search

The Coalition Structure Generation (CSG) problem is a partitioning of a set of agents into exhaus... more The Coalition Structure Generation (CSG) problem is a partitioning of a set of agents into exhaustive and disjoint coalitions to maximize social welfare. This NP-complete problem arises in many practical scenarios. Prominent examples are included in the field of transportation, e-Commerce, distributed sensor networks, and others. The fastest exact algorithm to solve the CSG problem is ODP-IP, which is a hybrid version of two previously established algorithms, namely Improved Dynamic Programming (IDP) and IP. In this paper, we show that the ODP-IP algorithm performs many redundant operations. To improve ODP-IP, we propose a faster abortion mechanism to speed up IP’s search. Our abortion mechanism decides at runtime which of the IP's operations are redundant to skip them. Then, we propose a modified version of IDP (named MIDP) and an improved version of IP (named IIP). Based on these two improved algorithms, we develop a hybrid version (MIDP-IIP) to solve the CSG problem. After a ...

2015 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT), 2015

Disaster management in railway network is an important issue. It requires to minimize negative im... more Disaster management in railway network is an important issue. It requires to minimize negative impact and also fast, efficient recovery from the disturbances. The main challenge here is that, the effect of inconvenience spreads out very fast in time and space. It takes noticeable amount of time to get back everything in the previous situation. This paper proposes a multi agent based algorithmic approach for disaster handling in Railway Network. This takes care of fast response to get total number of affected trains in a fast and efficient manner. We propose few algorithms to handle this situation and simulate it using JADE (Java Agent Development Framework) platform. Finally we take a case study and compare our proposed method with an existing manual technique.

Ijca Proceedings on International Conference on Recent Advances and Future Trends in Information Technology, Jun 4, 2012

As technology shifts from centralized computing to distributed computing and then to ubiquitous c... more As technology shifts from centralized computing to distributed computing and then to ubiquitous computing, the users are more dependent on the computer system for task delegation. Here autonomous agent and Multi Agent System (MAS) plays an important role to perform the task delegated by the user. As the fault in MAS is not-deterministic in nature, so designing fault tolerant MAS is a challenging research area. Here we propose a dynamic fault tolerant MAS interaction protocol. We model the proposed protocol using a high level Petri net. The model is analyzed to check the fault tolerance capability in different fault tolerant situation of the system.

International Journal of Computer Applications, May 31, 2012

In this work, we propose a new formal tool called CGPN (Conceptual Graph Petri Nets) which is a c... more In this work, we propose a new formal tool called CGPN (Conceptual Graph Petri Nets) which is a combination of CG (Conceptual Graph) and CPN (Color Petri Net) to model collaborative behavior of agents in a MAS(Multi Agent System) to achieve some goals. The CG is used to represent knowledge and on the other side CPN is used to model the concurrent and dynamic aspects of a system. It is difficult to extract precise information from MAS which is dynamic in nature. Modeling MAS with CGPN will help in representing the knowledge and dynamic behavior together. Finally, the CGPN model for MAS is tested for deadlock freedom and reachability analysis to verify its correctness.

Distributed Decision Making has become of increasing importance to get solution of different real... more Distributed Decision Making has become of increasing importance to get solution of different real life problems, where decision makers are in geographically dispersed locations. Application of agent and multi agent system in this Distributed Decision Support System is an evolving paradigm. One of such real life problem is medical diagnosis. For critical medical diagnosis, medical board is formed which is a coordinative discussion mechanism between a group of expert physicians to diagnose a patient. But always forming a medical board with a group of expert physicians may not be possible due to lack of infrastructure, availability, time etc. In that situation the role of multi agent based distributed decision making can comes into play. In this paper we develop a Virtual Medical Board System in which a number of software agents(expert agents) act as a group of expert physician with knowledge base(KB), reasoning capability. They coordinatively discuss with each other to diagnose a patient. We represent the discussion module of the system in the form of Bayesian Network of Bayesian Agent(BNBA). In BNBA each BA is the expert software agent whose Knowledge Base(KB) is represented in the form of Bayesian Network(BN). Also the BDI(Belief,Desire, Intention) model of each BA is represented in this paper.

2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing, 2012

Software agents can take decisions to perform different tasks to achieve a goal independently. Wh... more Software agents can take decisions to perform different tasks to achieve a goal independently. When a number of agents take decisions collaboratively in distributed environment to achieve same goal, they need to coordinate with each other in order to avoid inconsistencies. Coordination is the process of managing interactions between these agents by identifying and possibly resolving the inconsistencies which can occur between their activities. In this work we propose a methodology by which number of agents can take their decisions independently and collaboratively by maintaining coordination between them. We propose a concept of coordination ontology for distributed decision support system. It consists of set of rules in order to coordinate actions of different agents and make a decision to achieve a goal successfully.

2013 10th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology, 2013

Getting solution of a problem by group discussion is more reliable than getting solution from a s... more Getting solution of a problem by group discussion is more reliable than getting solution from a single entity. To increase reliability of the solution, efficient group of experts should be formed. Here in this paper we have proposed a methodology for finding efficient team of experts for solution of a given problem collaboratively. The methodology is conceptualized with the notion of Multiagent system. We have considered several factors like Cardinality of team, ability, willingness, trust and reciprocality of an agent in order to construct the team. We have also proposed an optimization function which will be used to choose most eligible agents to form the team of experts.

Nature Physics, 2010

Networks portray a multitude of interactions through which people meet, ideas are spread and infe... more Networks portray a multitude of interactions through which people meet, ideas are spread and infectious diseases propagate within a society 1-5. Identifying the most efficient 'spreaders' in a network is an important step towards optimizing the use of available resources and ensuring the more efficient spread of information. Here we show that, in contrast to common belief, there are plausible circumstances where the best spreaders do not correspond to the most highly connected or the most central people 6-10. Instead, we find that the most efficient spreaders are those located within the core of the network as identified by the k-shell decomposition analysis 11-13 , and that when multiple spreaders are considered simultaneously the distance between them becomes the crucial parameter that determines the extent of the spreading. Furthermore, we show that infections persist in the high-k shells of the network in the case where recovered individuals do not develop immunity. Our analysis should provide a route for an optimal design of efficient dissemination strategies. Spreading is a ubiquitous process, which describes many important activities in society 2-5. The knowledge of the spreading pathways through the network of social interactions is crucial for developing efficient methods to either hinder spreading in the case of diseases, or accelerate spreading in the case of information dissemination. Indeed, people are connected according to the way they interact with one another in society and the large heterogeneity of the resulting network greatly determines the efficiency and speed of spreading. In the case of networks with a broad degree distribution (number of links per node) 6 , it is believed that the most connected people (hubs) are the key players, being responsible for the largest scale of the spreading process 6-8. Furthermore, in the context of social network theory, the importance of a node for spreading is often associated with the betweenness centrality, a measure of how many shortest paths cross through this node, which is believed to determine who has more 'interpersonal influence' on others 9,10. Here we argue that the topology of the network organization plays an important role such that there are plausible circumstances under which the highly connected nodes or the highest-betweenness nodes have little effect on the range of a given spreading process. For example, if a hub exists at the end of a branch at the periphery of a network, it will have a minimal impact in the spreading process through the core of the network, whereas a less connected person who is strategically placed in the core of the network will have a significant effect that leads

Advancement in intelligent transportation systems with complex operations requires autonomous pla... more Advancement in intelligent transportation systems with complex operations requires autonomous planning and management to avoid collisions in day-to-day traffic. As failure and/or inadequacy in traffic safety system are life-critical, such collisions must be detected and resolved in an efficient way to manage continuously rising traffic. In this paper, we address different types of collision scenarios along with their early detection and resolution techniques in a complex railway system. In order to handle collisions dynamically in distributed manner, a novel agent based solution approach is proposed using the idea of max-sum algorithm, where each agent (train agent, station agent, and junction agent) communicates and cooperates with others to generate a good feasible solution that keeps the system in a safe state, i.e., collision free. We implement the proposed mechanism in Java Agent DEvelopment Framework (JADE). The results are evaluated with exhaustive experiments and compared wi...

cs.unb.ca

Negotiation is a decision making process through which several individuals, with differing points... more Negotiation is a decision making process through which several individuals, with differing points of view, attempt to interactively reach an agreement. It involves the discussion and evaluation of the problem as well as the consideration of alternatives. Therefore, a large number of possibilities should be evaluated by the decision makers, which is time consuming and difficult . A negotiation support system could be used to facilitate interactions between different individuals. In this project, semantic web concepts such as ontologies and semantic reasoning are employed to implement a system to facilitate negotiation. The target domain of this project is negotiation over the treatment of wisdom teeth.