Vincent A Cicirello

Vincent A Cicirello
Stockton University · Computer Science

PhD

About

73
Publications
11,158
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
1,479
Citations
Additional affiliations
September 2014 - present
Stockton University
Position
  • Professor (Full)
September 2010 - August 2014
Stockton University
Position
  • Professor (Associate)
September 2005 - August 2010
Stockton University
Position
  • Professor (Assistant)
Education
August 1999 - July 2003
Carnegie Mellon University
Field of study
  • Robotics
September 1994 - June 1999
Drexel University
Field of study
  • Computer Science

Publications

Publications (73)
Conference Paper
Full-text available
In this paper, we introduce a new crossover operator for the permutation representation of a GA. This new operator— Non-Wrapping Order Crossover (NWOX)—is a variation of the well-known Order Crossover (OX) operator. It strongly preserves relative order, as does the original OX, but also respects the absolute positions within the parent permuta- tio...
Conference Paper
Full-text available
The multiarmed bandit is often used as an analogy for the tradeoff between exploration and exploitation in search problems. The classic problem involves allocating trials to the arms of a multiarmed slot machine to maximize the expected sum of rewards. We pose a new variation of the multiarmed bandit--the Max K-Armed Bandit--in which trials must be...
Article
Full-text available
There are hundreds of distinct 3D, CAD and engineering file formats. As engineering design and analysis has become increasingly digital, the proliferation of file formats has created many problems for data preservation, data exchange, and interoperability. In some situations, physical file objects exist on legacy media and must be identified and in...
Article
Full-text available
The natural encoding for many search and optimization problems is the permutation, such as the traveling salesperson, vehicle routing, scheduling, assignment and mapping problems, among others. The effectiveness of a given mutation or crossover operator depends upon the nature of what the permutation represents. For some problems, it is the absolut...
Article
Full-text available
Evolutionary algorithms solve problems by simulating the evolution of a population of candidate solutions. We focus on evolving permutations for ordering problems such as the traveling salesperson problem (TSP), as well as assignment problems such as the quadratic assignment problem (QAP) and largest common subgraph (LCS). We propose cycle mutation...
Preprint
Full-text available
Evolutionary algorithms solve problems by simulating the evolution of a population of candidate solutions. We focus on evolving permutations for ordering problems like the traveling salesperson problem (TSP), as well as assignment problems like the quadratic assignment problem (QAP) and largest common subgraph (LCS). We propose cycle mutation, a ne...
Article
Full-text available
The runtime behavior of Simulated Annealing (SA), similar to other metaheuristics, is controlled by hyperparameters. For SA, hyperparameters affect how “temperature” varies over time, and “temperature” in turn affects SA’s decisions on whether or not to transition to neighboring states. It is typically necessary to tune the hyperparameters ahead of...
Article
Full-text available
Simulated annealing is a metaheuristic commonly used for combinatorial optimization in many industrial applications. Its runtime behavior is controlled by an algorithmic component known as the annealing schedule. The classic annealing schedules have control parameters that must be set or tuned ahead of time. Adaptive annealing schedules, such as th...
Article
Full-text available
An edit distance is a measure of the minimum cost sequence of edit operations to transform one structureinto another. Edit distance can be used as a measure of similarity as part of a pattern recognition system, withlower values of edit distance implying more similar structures. Edit distance is most commonly encounteredwithin the context of string...
Chapter
Full-text available
Commonly used computational and analytical tools for fitness landscape analysis of optimization problems require identifying a distance metric that characterizes the similarity of different solutions to the problem. For example, fitness distance correlation is Pearson correlation between solution fitness and distance to the nearest optimal solution...
Preprint
Full-text available
An edit distance is a measure of the minimum cost sequence of edit operations to transform one structure into another. Edit distance is most commonly encountered within the context of strings, where Wagner and Fischer's string edit distance is perhaps the most well-known. However, edit distance is not limited to strings. For example, there are seve...
Preprint
Full-text available
In this report, I describe the design and implementation of an inexpensive, eight node, 32 core, cluster of raspberry pi single board computers, as well as the performance of this cluster on two computational tasks, one that requires significant data transfer relative to computational time requirements, and one that does not. We have two use-cases...
Conference Paper
Full-text available
In this paper, we propose: (a) a restart schedule for an adaptive simulated annealer, and (b) parallel simulated annealing, with an adaptive and parameter-free annealing schedule. The foundation of our approach is the Modified Lam annealing schedule, which adaptively controls the temperature parameter to track a theoretically ideal rate of acceptan...
Data
Weighted Tardiness Scheduling with Sequence-Dependent Setups This set of benchmark instances for the problem known as Weighted Tardiness Scheduling with Sequence Dependent Setups originated in 2003 as part of the Ph.D. Dissertation research of Vincent A. Cicirello from Carnegie Mellon University's Robotics Institute. This benchmark set includes th...
Conference Paper
Full-text available
Genetic algorithms, and other forms of evolutionary computation, are controlled by numerous parameters, such as crossover and mutation rates, population size, among others depending upon the specific form of evolutionary computation as well as which operators are employed. Setting the values for these parameters is no simple task. In this paper, we...
Conference Paper
Full-text available
Local search algorithms, such as simulated annealing, tabu search, and local hill climbers attempt to optimize a solution to a problem by making locally improving modifications to a candidate solution. They rely on a neighborhood operator to restrict the search to a typically small set of possible successor states. The genetic algorithm mutation op...
Article
Full-text available
In this paper, we present a group, asynchronous problem solving exercise designed to introduce non-computer science students to a variety of concepts from artificial intelligence and operations research. The exercise is designed to be a Computer Science (CS) Unplugged activity suitable for the online classroom. CS Unplugged is a methodology for tea...
Article
Full-text available
A Real Projects for Real Clients Course (RPRCC) is a course that provides students with the opportunity to develop a solution to a real problem. Students interact directly with a real client, and work on solving a problem for that client. RPRCCs are examples of service learning. Within the computing sciences, there has been a recent surge in the in...
Conference Paper
Full-text available
In this paper, we consider the permutation representation of genetic algorithms, and more generally, local search algorithms. We use a variety of permutation distance measures to profile the behavior of the most commonly used mutation operators for permutation-based genetic algorithms. Our operator profiles are also applicable to other local search a...
Patent
Full-text available
A method for determining a similarity of a first solid model to a second solid model is disclosed. The method includes the steps of: selecting a set of features for representing the first solid model; extracting features corresponding to the selected set of features from the first solid model; constructing an undirected model dependency graph of th...
Conference Paper
Full-text available
Dispatch scheduling policies offer a computationally inexpensive approach to many scheduling problems as an alternative to more processor intensive search algorithms. They are especially useful in dynamic situations where problem solving may be temporally constrained. However, dispatch heuristics have also been effectively used for guidance within...
Article
Full-text available
In recent years, we have seen an increased use of pair programming in CS-1 courses. Widespread evidence shows pair programming as beneficial at all levels of programming skill. During three academic years, we studied what students in CS-1 choose when given the option to either pair program or to program independently. We explore which students choo...
Article
Full-text available
Active learning has become an important part of effective computer science pedagogy. Active learning helps to keep students engaged in the learning process and is useful at all levels of computer science education from introductory courses on programming through more advanced upper level topics and graduate level coursework. In this paper, we prese...
Conference Paper
Full-text available
In this paper, we explore the potential important role that unannounced (or "pop") quizzes can play in CS-1. "Pop" quizzes generate continual feedback to both the student and the instructor of the course. They also encourage students to avoid missing class unless necessary. We present the results of a three year study on the effectiveness of "pop"...
Conference Paper
In this paper we present a set of benchmark instances and a benchmark instance generator for a single-machine scheduling problem known as the weighted tardiness scheduling problem with sequence-dependent setups. Furthermore, we argue that it is an ideal benchmark problem for soft computing in that it is computationally hard and does not lend itsel...
Conference Paper
Full-text available
Wireless networking has become an extremely common household technology in a matter of only a few years. Concerns for privacy have become more relevant than ever, with more cases of identity and data theft occurring everyday. Initially, consumer grade wireless technology was distributed without security being a major concern. Today, almost every co...
Article
Full-text available
This article introduces a course the author recently designed; and which was first taught in Fall 2006. The course provides an introduction to the field of artificial intelligence (AI) focused at non-majors as part of a liberal arts curriculum. The course provides an overview of the foundational science and philosophy at the heart of AI from an int...
Conference Paper
Full-text available
Designing a scheduling competition to attract researchers from the several fields interested in scheduling problems seems a challenging, and highly worthwhile effort. In this paper, we propose a design for one possible track of this proposed scheduling competition. Specifically, we propose a track aimed at one machine sequencing problems. We argue...
Conference Paper
Full-text available
In this paper, we demonstrate the ease in which an adaptive simulated annealing algorithm can be designed. Specifically, we use the adaptive annealing schedule known as the modified Lam schedule to apply simulated annealing to the weighted tardiness scheduling problem with sequence-dependent setups. The modified Lam annealing schedule adjusts the temp...
Article
Full-text available
Mobile ad hoc networks will form a critical part of the first-responder communications infrastructure. Empirical data shows how network-aware, autonomous, mobile agents can manage information services on live manet environments. A multidisciplinary team in Drexel University's College of Engineering has been working with local law enforcement and tr...
Conference Paper
Full-text available
Wireless mobile ad-hoc networks (MANETS) of personal digital assistants (PDAs) are a growing field of study due to potential applications in environments that lack a functioning communications infrastructure. Mobile computing platforms such as PDAs and tablet PCs offer software designers great challenges to the design of survivable software applica...
Conference Paper
Full-text available
Designing decentralized software applications for a wireless network environment offers harsh challenges to the software engineer. All of the usual difficulties associated with a distributed system are present, but are amplified by the inherent dynamics and uncertainty of the wireless network. This paper takes an agent-oriented software engineering...
Conference Paper
Full-text available
Using smart-phones for ad-hoc mathematical collaboration poses multiple user interface challenges. In this paper, software agents are used to lessen the cognitive load through automatic line labeling. Researchers in the human-computer interaction community ...
Conference Paper
Full-text available
This paper overviews the Philadelphia Area Urban Wireless Net- work Testbed (PA-UWNT) project and several applications of ar- tificial intelligence therein. PA-UWNT is a research and develop- ment effort in mobile and ubiquitous computing, focusing on com- munication and collaboration between first responders and other emergency personnel. Support...
Article
Full-text available
Stochastic search algorithms are often robust, scalable problem solvers. In this paper, we concern ourselves with the class of stochastic search algorithms called stochastic sampling. Randomization in such a search framework can be an efiective means of expanding search around a stochastic neighborhood of a strong domain heuristic. Speciflcally, we...
Article
Full-text available
A mobile ad hoc network (MANET) is a wireless network of mobile devices-such as PDAs, laptops, cell phones, and other lightweight, easily transportable computing devices-in which each node can act as a router for network traffic rather than relying on fixed networking infrastructure. As mobile computing becomes ubiquitous, MANETS becomes increasing...
Conference Paper
Full-text available
Security of an agent system is often limited, relying on basic cryptographic techniques without consideration of issues such as key maintenance, forming and communicating in secure groups, or interlayer security. From a security engineering perspective, multi-agent systems introduce new channels and possibly layers, resulting in additional security...
Conference Paper
Full-text available
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling algorithms such as heuristic-biased stochastic sam- pling (HBSS) and value-biased stochastic sampling (VBSS), wherein a heuristic is used to bias a stochastic policy for...
Article
Full-text available
We will demonstrate the Secure Wireless Agent Testbed (SWAT), a unique facility developed at Drexel University to study integration, networking and information assurance for next-generation wireless mobile agent systems. SWAT is an implemented system that fully integrates: (1) mobile agents, (2) wireless ad hoc multi-hop networks, and (3) security....
Conference Paper
Full-text available
We will demonstrate the Secure Wireless Agent Testbed (SWAT), a unique facility developed at Drexel University to study integration, networking and information assurance for next-generation wireless mobile agent systems. SWAT is an implemented system that fully integrates: 1) mobile agents, 2) wireless ad hoc multi-hop networks, and 3) security. Th...
Article
Full-text available
Agent-based approaches to manufacturing scheduling and control have gained increasing attention in recent years. Such approaches are attractive because they offer increased robustness against the unpredictability of factory operations. But the specification of local coordination policies that give rise to efficient global performance and effectivel...
Conference Paper
Full-text available
The problem of maintaining a desired number of mobile agents on a network is not trivial, especially if we want a completely decentralized solution. Decentralized control makes a system more robust and less susceptible to partial failures. The problem is exacerbated on wireless ad hoc networks where host mobility can result in significant changes i...
Conference Paper
Full-text available
The problem of maintaining a desired number of mobile agents on a network is not trivial, especially if we want a completely decentralized solution. Decentralized control makes a system more robust and less susceptible to partial failures. The problem is exacerbated on wireless ad hoc networks where host mobility can result in significant changes i...
Thesis
Full-text available
In many combinatorial domains, simple stochastic algorithms often exhibit superior performance when compared to highly customized approaches. Many of these simple algorithms outperform more sophisticated approaches on difficult benchmark problems; and often lead to better solutions as the algorithms are taken out of the world of benchmarks and into...
Conference Paper
Full-text available
This paper describes a market-based planning mechanism used for task and resource allocation within a larger distributed, multi-robot control and coordination architecture. We are developing an extension to the traditional three-layered robot architecture that enables robots to interact directly at each layer -- at the behavioral level, the robots...
Conference Paper
Full-text available
This paper presents a market-based, multi-robot planning capability, designed as part of a distributed, layered architecture for multi-robot control and coordination. More specifically, we are developing an extension to the traditional three-layered robot architecture that enables robots to interact directly at each layer: the behavioral level, the...
Technical Report
Full-text available
Abstract This report details a set of benchmark,problem,instances that we have generated for the weighted tardiness scheduling with sequence-dependent setups problem. The version of the problem,without setup times is NP-Hard. The problem is further complicated,by the sequence-dependent nature of the setups. Given that the weighted,tardiness objec-...
Article
Full-text available
Solid models are the critical data elements in modern computer-aided design environments, because they describe the shape and form of manufactured artifacts. Their growing ubiquity has created new problems in how to effectively manage the many models that are now stored in the digital libraries for large design and manufacturing enterprises. E...
Conference Paper
Full-text available
This paper presents an architecture that enables multiple robots to explicitly coordinate actions at multiple levels of abstraction. In particular, we are developing an extension to the traditional three-layered robot architecture that enables robots to interact directly at each layer { at the behavioral level, the robots create distributed control...
Conference Paper
Full-text available
Randomization as a means for improving search performance in combinatorial domains has received increasing interest in recent years. In optimization contexts, it can provide a means for overcoming the deficiencies of available search heuristics and broadening search in productive directions. In this paper, we consider the issue of amplifying the pe...
Conference Paper
Full-text available
Agent-based approaches to scheduling have gained increasing attention in recent years. One inherent advantage of agent-based approaches is their tendency for robust behavior; since activity is coordinated via local interaction protocols and decision policies, the system is insensitive to unpredictability in the executing environment. At the same ti...
Conference Paper
Full-text available
The factory is a complex dynamic environment and scheduling operations for such an environment is a challenging problem. In practice, dispatch scheduling policies are commonly employed, as they offer an efficient and robust solution. However, dispatch scheduling policies are generally myopic, and as such they are susceptible to sub-optimal decision...
Conference Paper
Full-text available
The factory is a complex dynamic environment and scheduling operations for such an environment is a challenging problem. In practice, dispatch scheduling policies are commonly employed, as they offer an efficient and robust solution. However, dispatch scheduling policies are generally myopic, and as such they are susceptible to sub-optimal decision...
Technical Report
Full-text available
In recent years, the desire for a more robust basis for coordination in manufacturing environments has motivated research into agent-based approaches to manufacturing scheduling and control. We have been developing a series of such multi-agent systems inspired by models of social insect behavior for the problem of dynamic shop floor routing. To dat...
Conference Paper
Full-text available
In this paper, we present examples from the literature of successful problem solving systems that have been heavily influenced directly from biological studies of insect societies. Included among these systems are a few of our own. These examples are presented in light of manufacturing applications and only the tip of the iceberg is touched upon. I...
Conference Paper
Full-text available
Agent-based approaches to manufacturing scheduling and control are attractive because they offer increased robustness against the unpredictability of factory operations. Previously, we introduced a new approach to coordinating factory routing and scheduling based on a computational model of wasp behavior. The natural multi-agent system of the wasp...
Conference Paper
Full-text available
Agent-based approaches to manufacturing scheduling and control have gained increasing attention in recent years. Such approaches are attractive because they offer increased robustness against the unpredictability of factory operations. But the specification of local coordination policies that give rise to efficient global performance and effectivel...
Conference Paper
Full-text available
Solid models are the critical data elements in modern computer-aided design (CAD) environments, describing the shape and form of manufactured artifacts. Their growing ubiquity has created new problems in how to effectively manage the many models that are now stored in the digital libraries of large design and manufacturing enterprises. Existing tec...
Conference Paper
Full-text available
Solid models are the critical data elements in modern computer-aided design (CAD) environments, describing the shape and form of manufactured artifacts. Their growing ubiquity has created new problems in how to effectively manage the many models that are now stored in the digital libraries of large design and manufacturing enterprises. Existing tec...
Conference Paper
Full-text available
We introduce a new approach to autonomous decentralized shop floor routing. Our system, which we call Ant Colony Control (AC<sup>2</sup>), applies the analogy of a colony of ants foraging for food to the problem of dynamic shop floor routing. In this system, artificial ants use only indirect communication to make all shop routing decisions by alter...
Conference Paper
Full-text available
Optimization of the control parameters of genetic algorithms is often a time consuming and tedious task. In this work we take the meta-level genetic algorithm approach to control parameter optimization. We enhance this process by incorporating a neural network for fitness evaluation. This neural network is trained to learn the complex interactions...
Article
Full-text available
Under this NSF CAREER project, we are developing representations and algorithms to manage large digital libraries of complex engineering knowledge. The algorithms and data structures we are creating will integrate knowledge-bases of geometric information with systems for case-based reasoning and digital information retrieval. The research in this h...
Article
This paper describes our initial efforts to deploy a digital library to support computer-aided collaborative design. At present, this experimental testbed, The Engineering Design Knowledge Repository, is an effort to collect and archive public domain engineering data for use by researchers and engineering professionals. We envision this effort expa...
Conference Paper
Full-text available
Nearly all major commercial computer-aided design systems have adopted a feature-based design approach to solid modeling. Models are created via a sequence of operations which apply design features to incremental versions of a design model. Even surfacing, free-form surface shaping, and deformation operations are internally represented in modeling...
Thesis
Full-text available
....................................... ix 1 INTRODUCTION . . .............................. 1 1.1 ProblemStatement ............................... 1 1.2 OverviewofApproach............................. 4 1.3 Outline of Thesis . . .............................. 5 2 BACKGROUND . . . .............................. 6 2.1 GraphMatching ....................
Thesis
Thesis (M.S.)--Drexel University, 1999.

Network

Cited By

Projects

Projects (2)
Project
I am the Guest Editor of a Special Issue of Applied Sciences on the topic of Evolutionary Computation. Full details, including the CFP are found at: https://www.mdpi.com/journal/applsci/special_issues/Evolutionary_Computation Evolutionary computation offers powerful problem-solving methodologies inspired by models of natural genetics and evolutionary processes. Potential applications are wide-ranging and include problems from combinatorial optimization, numerical optimization, multi-objective optimization, and others as well as specific applications of these problems in diverse domains, such as engineering, design, medicine, robotics, science, etc. Techniques from evolutionary computation often lend themselves well to parallel and distributed implementations and are often more effective in dealing with challenging problem characteristics such as non-linearity and high-dimensionality than alternative approaches. This Special Issue invites submissions on recent advances in the theory and applications of evolutionary computation. Papers on all forms of evolutionary computation are welcome, including but not limited to genetic algorithms, genetic programming, evolution strategies, evolutionary programming, and memetic algorithms, as well as papers at the intersection of evolutionary computation and machine learning, such as neuroevolution. Additionally, we welcome papers that employ closely related techniques such as simulated annealing, ant colony optimization, particle swarm optimization, artificial immune systems, and other metaheuristics. All application areas are welcome, but submissions that deal with problems in the applied sciences are especially encouraged.
Project
I have been exploring the fitness landscapes of permutation optimization problems, problems where one must find an optimal ordering of some discrete set (e.g., scheduling problems). Such permutation problems fall into one of three broad categories, depending upon the structural characteristics of greatest influence on solution fitness (absolute positioning of elements, relative positioning of elements, or element precedences), although some problems may span more than one of these categories.