Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- China Simulation Federation (3880)
- Singapore Management University (1881)
- Old Dominion University (640)
- San Jose State University (277)
- MBZUAI (233)
-
- City University of New York (CUNY) (184)
- Technological University Dublin (157)
- Air Force Institute of Technology (137)
- Chapman University (124)
- California Polytechnic State University, San Luis Obispo (116)
- Chinese Academy of Sciences (111)
- University of Arkansas, Fayetteville (100)
- Lindenwood University (97)
- Edith Cowan University (92)
- Embry-Riddle Aeronautical University (92)
- University of Nebraska - Lincoln (78)
- University of Kentucky (76)
- University of South Florida (71)
- University of Nevada, Las Vegas (63)
- Clemson University (60)
- Dartmouth College (60)
- University of Denver (59)
- Utah State University (57)
- University of Michigan Law School (56)
- The Texas Medical Center Library (54)
- Thomas Jefferson University (54)
- New Jersey Institute of Technology (53)
- University of Malaya (50)
- Purdue University (48)
- Missouri University of Science and Technology (47)
- Keyword
-
- Artificial intelligence (778)
- Machine learning (685)
- Deep learning (435)
- Machine Learning (359)
- Artificial Intelligence (356)
-
- AI (234)
- Deep Learning (201)
- Simulation (160)
- Computer vision (157)
- Reinforcement learning (140)
- Generative AI (134)
- Neural networks (128)
- Natural language processing (108)
- Large language models (107)
- Robotics (97)
- Natural Language Processing (90)
- ChatGPT (89)
- Path planning (88)
- Optimization (82)
- Large Language Models (77)
- Computer Vision (75)
- Classification (71)
- Neural network (67)
- Neural Networks (65)
- Virtual reality (64)
- Reinforcement Learning (63)
- Computer Science (59)
- Cybersecurity (59)
- Genetic algorithm (58)
- Algorithms (57)
- Publication Year
- Publication
-
- Journal of System Simulation (3880)
- Research Collection School Of Computing and Information Systems (1648)
- Master's Projects (248)
- Theses and Dissertations (183)
- Computer Science Faculty Publications (124)
-
- Bulletin of Chinese Academy of Sciences (Chinese Version) (111)
- Faculty Scholarship (108)
- Publications and Research (99)
- Computer Vision Faculty Publications (98)
- Master's Theses (96)
- Conference papers (92)
- Electrical & Computer Engineering Faculty Publications (90)
- Machine Learning Faculty Publications (86)
- Electronic Theses and Dissertations (85)
- Faculty Publications (77)
- Dissertations (69)
- Research outputs 2022 to 2026 (64)
- USF Tampa Graduate Theses and Dissertations (59)
- Dissertations and Theses Collection (Open Access) (57)
- Articles (54)
- Dissertations, Theses, and Capstone Projects (53)
- Theses and Dissertations--Computer Science (48)
- Natural Language Processing Faculty Publications (46)
- Teaching and Generative AI: Pedagogical Possibilities and Productive Tensions (46)
- Graduate Theses and Dissertations (43)
- Open Access Theses & Dissertations (42)
- Theses (40)
- Electrical & Computer Engineering Theses & Dissertations (39)
- Graduate Theses, Dissertations, and Problem Reports (ETD) (39)
- Publications (39)
- Publication Type
- File Type
Articles 10741 - 10770 of 11145
Full-Text Articles in Computer Sciences
Agent Sensing With Stateful Resources, Adam D. Eck
Agent Sensing With Stateful Resources, Adam D. Eck
School of Computing: Dissertations, Theses, and Student Research
In many real-world applications of multi-agent systems, agent reasoning suffers from bounded rationality caused by both limited resources and limited knowledge. When agent sensing also requires resource use, the agent’s knowledge revision is affected due to its inability to always sense when and as accurately as needed, further leading to poor decision making. In this research, we consider what happens when sensing activities require the use of stateful resources, which we define as resources whose state-dependent behavior changes over time based on usage. Specifically, sensing itself can change the state of a resource, and thus its behavior, which affects both …
Semi-Autonomous Virtual Valet Parking, Arne Suppe, Luis Navarro-Serment, Aaron Steinfeld
Semi-Autonomous Virtual Valet Parking, Arne Suppe, Luis Navarro-Serment, Aaron Steinfeld
Research Collection School Of Computing and Information Systems
Despite regulations specifying parking spots that support wheelchair vans, it is not uncommon for end users to encounter problems with clearance for van ramps. Even if a driver elects to park in the far reaches of a parking lot as a precautionary measure, there is no guarantee that the spot next to their van will be empty when they return. Likewise, the prevalence of older drivers who experience significant difficulty with ingress and egress from vehicles is nontrivial and the ability to fully open a car door is important. This work describes a method and user interaction for low cost, …
Electroencephalogram Artifact Removal Using A Wavelet Neural Network, Hoang-Anh T. Nguyen
Electroencephalogram Artifact Removal Using A Wavelet Neural Network, Hoang-Anh T. Nguyen
Electrical & Computer Engineering Theses & Dissertations
A wavelet neural network (WNN) technique rs developed for electroencephalogram (EEG) artifact removal without electrooculographic (EOG) recordings. The algorithm combines the universal approximation characteristics of neural networks and the time/frequency property of wavelet, where the neural network was trained on a simulated dataset with known ground truths. The contribution of this thesis is two-fold. First, many EEG artifact removal algorithms, including regression based methods, require reference EOG signals, which are not always available. To remove EEG ai1ifacts, a WNN tries to learn the characteristics of the artifacts first and does not need reference EOG signals once trained. Second, WNNs are …
Faculty Success: Developing A Research And Publication Agenda, Kathleen P. King
Faculty Success: Developing A Research And Publication Agenda, Kathleen P. King
Department of Leadership, Policy, and Lifelong Learning
Anyone associated with higher education will acknowledge that tenure track faculty have to perform a fantastic balancing act. Compared to an administrative or line role in an organization, higher education faculty have tremendous autonomy and freedom. However, they face competing demands of many different (and good) opportunities, and for them the stakes are always high. Help is here! This article introduces a powerful strategy for staying on track in the research strand of this competitive journey.
Event Study Method For Validating Agent-Based Trading Simulations, Shih-Fen Cheng
Event Study Method For Validating Agent-Based Trading Simulations, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
In this paper, we introduce how one can validate an event-centric trading simulation platform that is built with multi-agent technology. The issue of validation is extremely important for agent-based simulations, but unfortunately, so far there is no one universal method that would work in all domains. The primary contribution of this paper is a novel combination of event-centric simulation design and event study approach for market dynamics generation and validation. In our event-centric design, the simulation is progressed by announcing news events that affect market prices. Upon receiving these events, event-aware software agents would adjust their views on the market …
A Biologically-Inspired Cognitive Agent Model Integrating Declarative Knowledge And Reinforcement Learning, Ah-Hwee Tan, Gee-Wah Ng
A Biologically-Inspired Cognitive Agent Model Integrating Declarative Knowledge And Reinforcement Learning, Ah-Hwee Tan, Gee-Wah Ng
Research Collection School Of Computing and Information Systems
The paper proposes a biologically-inspired cognitive agent model, known as FALCON-X, based on an integration of the Adaptive Control of Thought (ACT-R) architecture and a class of self-organizing neural networks called fusion Adaptive Resonance Theory (fusion ART). By replacing the production system of ACT-R by a fusion ART model, FALCON-X integrates high-level deliberative cognitive behaviors and real-time learning abilities, based on biologically plausible neural pathways. We illustrate how FALCON-X, consisting of a core inference area interacting with the associated intentional, declarative, perceptual, motor and critic memory modules, can be used to build virtual robots for battles in a simulated RoboCode …
Is Competition Making A Comeback? Discovering Methods To Keep Female Adolescents Engaged In Stem: A Phenomenological Approach, Kathryn B. Notter
Is Competition Making A Comeback? Discovering Methods To Keep Female Adolescents Engaged In Stem: A Phenomenological Approach, Kathryn B. Notter
College of Education and Human Sciences: Dissertations, Theses, and Student Research
The decreasing number of women who are graduating in the Science, Technology, Engineering and Mathematics (STEM) fields continues to be a major concern. Despite national support in the form of grants provided by National Science Foundation, National Center for Information and Technology and legislation passed such as the Deficit Reduction Act of 2005 that encourages women to enter the STEM fields, the number of women actually graduating in these fields is surprisingly low. This research study focuses on a robotics competition and its ability to engage female adolescents in STEM curricula. Data have been collected to help explain why young …
Early Stopping Of A Neural Network Via The Receiver Operating Curve., Daoping Yu
Early Stopping Of A Neural Network Via The Receiver Operating Curve., Daoping Yu
Electronic Theses and Dissertations
This thesis presents the area under the ROC (Receiver Operating Characteristics) curve, or abbreviated AUC, as an alternate measure for evaluating the predictive performance of ANNs (Artificial Neural Networks) classifiers. Conventionally, neural networks are trained to have total error converge to zero which may give rise to over-fitting problems. To ensure that they do not over fit the training data and then fail to generalize well in new data, it appears effective to stop training as early as possible once getting AUC sufficiently large via integrating ROC/AUC analysis into the training process. In order to reduce learning costs involving the …
Automated Theorem Prover Axiom Management, Ashley T. Holeman, Ewen Denney
Automated Theorem Prover Axiom Management, Ashley T. Holeman, Ewen Denney
STAR Program Research Presentations
Automated Theorem Provers (ATPs), are computer programs that use collections of axioms,which are logical statements assumed to be true, in order to prove conjectures. NASA uses these programs to verify safety and functional requirements in domains like Guidance, Navigation, and Control. There are about 30 axioms on each major topic including the theory of coordinate systems, elementary arithmetic and linear algebra. These axioms have been created over the duration of many projects and combined into a single file. One task is to manage the axioms by arranging them into logical sections, deleting unnecessary ones and rewriting some into a more …
A Comparative Study Of Filter-Based Feature Ranking Techniques, Huanjing Wang, Taghi M. Khoshgoftaar, Kehan Gao
A Comparative Study Of Filter-Based Feature Ranking Techniques, Huanjing Wang, Taghi M. Khoshgoftaar, Kehan Gao
Computer Science Faculty Publications
One factor that affects the success of machine learning is the presence of irrelevant or redundant information in the training data set. Filter-based feature ranking techniques (rankers) rank the features according to their relevance to the target attribute and we choose the most relevant features to build classification models subsequently. In order to evaluate the effectiveness of different feature ranking techniques, a commonly used method is to assess the classification performance of models built with the respective selected feature subsets in terms of a given performance metric (e.g., classification accuracy or misclassification rate). Since a given performance metric usually can …
A Comparative Study Of Threshold-Based Feature Selection Techniques, Huanjing Wang, Taghi M. Khoshgoftaar, Jason Van Hulse
A Comparative Study Of Threshold-Based Feature Selection Techniques, Huanjing Wang, Taghi M. Khoshgoftaar, Jason Van Hulse
Computer Science Faculty Publications
Abstract Given high-dimensional software measurement data, researchers and practitioners often use feature (metric) selection techniques to improve the performance of software quality classification models. This paper presents our newly proposed threshold-based feature selection techniques, comparing the performance of these techniques by building classification models using five commonly used classifiers. In order to evaluate the effectiveness of different feature selection techniques, the models are evaluated using eight different performance metrics separately since a given performance metric usually captures only one aspect of the classification performance. All experiments are conducted on three Eclipse data sets with different levels of class imbalance. The …
Topology In Composite Spatial Terms, John D. Kelleher, Robert J. Ross
Topology In Composite Spatial Terms, John D. Kelleher, Robert J. Ross
Conference papers
People often refer to objects by describing the object's spatial location relative to another object, e.g. the book on the right of the table. This type of referring expression is called a spatial locative expression. Spatial locatives have three major components: (1) the target object that is being located (the book), (2) the landmark object relative to which the target is being located (the table), and (3) the description of the spatial relationship that exists between the target and the landmark (on the right of ). In English spatial relationships are often described using spatial prepositions. The set of English …
Distributed Route Planning And Scheduling Via Hybrid Conflict Resolution, Ramesh Thangarajoo, Hoong Chuin Lau
Distributed Route Planning And Scheduling Via Hybrid Conflict Resolution, Ramesh Thangarajoo, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
In this paper, we discuss the problem of route planning and scheduling by a group of agents. Each agent is responsible for designing a route plan and schedule over a geographical network, and the goal is to obtain a conflict-free plan/schedule that optimizes a global objective. We present a hybrid conflict resolution method that involves coalition formation and distributed constraint satisfaction depending on the level of coupling between agents. We show how this approach can be effectively applied to solve a distributed convoy movement planning problem.
Decentralized Resource Allocation And Scheduling Via Walrasian Auctions With Negotiable Agents, Huaxing Chen, Hoong Chuin Lau
Decentralized Resource Allocation And Scheduling Via Walrasian Auctions With Negotiable Agents, Huaxing Chen, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
This paper is concerned with solving decentralized resource allocation and scheduling problems via auctions with negotiable agents by allowing agents to switch their bid generation strategies within the auction process, such that a better system wide performance is achieved on average as compared to the conventional walrasian auction running with agents of fixed bid generation strategy. We propose a negotiation mechanism embedded in auctioneer to solicit bidders’ change of strategies in the process of auction. Finally we benchmark our approach against conventional auctions subject to the real-time large-scale dynamic resource coordination problem to demonstrate the effectiveness of our approach.
A Decision Theoretic Approach To Data Leakage Prevention, Janusz Marecki, Mudhakar Srivastava, Pradeep Reddy Varakantham
A Decision Theoretic Approach To Data Leakage Prevention, Janusz Marecki, Mudhakar Srivastava, Pradeep Reddy Varakantham
Research Collection School Of Computing and Information Systems
In both the commercial and defense sectors a compelling need is emerging for rapid, yet secure, dissemination of information. In this paper we address the threat of information leakage that often accompanies such information flows. We focus on domains with one information source (sender) and many information sinks (recipients) where: (i) sharing is mutually beneficial for the sender and the recipients, (ii) leaking a shared information is beneficial to the recipients but undesirable to the sender, and (iii) information sharing decisions of the sender are determined using imperfect monitoring of the (un)intended information leakage by the recipients.We make two key …
On Decision Support For Deliberating With Constraints In Constrained Optimization Models, Steven O. Kimbrough, Ann Kuo, Hoong Chuin Lau, David H. Wood
On Decision Support For Deliberating With Constraints In Constrained Optimization Models, Steven O. Kimbrough, Ann Kuo, Hoong Chuin Lau, David H. Wood
Research Collection School Of Computing and Information Systems
This paper introduces the Deliberation Decision Support System (DDSS). The DDSS obtains heuristically (using a genetic algorithm) solutions of interest for constrained optimization models. This is illustrated, without loss of generality, by generalized assignment problems. The DDSS also provides users with graphical tools that support post-solution deliberation for constrained optimization models. The DDSS and this paper, as befits practical concerns, are focused on deliberation with respect to the constraints of the models being used.
The Bi-Objective Master Physician Scheduling Problem, Aldy Gunawan, Hoong Chuin Lau
The Bi-Objective Master Physician Scheduling Problem, Aldy Gunawan, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Physician scheduling is the assignment of physicians to perform different duties in the hospital timetable. In this paper, the goals are to satisfy as many physicians’ preferences and duty requirements as possible while ensuring optimum usage of available resources. We present a mathematical programming model to represent the problem as a bi-objective optimization problem. Three different methods based on ε–Constraint Method, Weighted-Sum Method and HillClimbing algorithm are proposed. These methods were tested on a real case from the Surgery Department of a large local government hospital, as well as on randomly generated problem instances. The strengths and weaknesses of the …
Effect Of Human Biases On Human-Agent Teams, Praveen Paruchuri, Pradeep Reddy Varakantham, Katia Sycara, Paul Scerri
Effect Of Human Biases On Human-Agent Teams, Praveen Paruchuri, Pradeep Reddy Varakantham, Katia Sycara, Paul Scerri
Research Collection School Of Computing and Information Systems
As human-agent teams get increasingly deployed in the real-world, agent designers need to take into account that humans and agents have different abilities to specify preferences. In this paper, we focus on how human biases in specifying preferences for resources impacts the performance of large, heterogeneous teams. In particular, we model the inclination of humans to simplify their preference functions and to exaggerate their utility for desired resources, and show the effect of these biases on the team performance. We demonstrate this on two different problems, which are representative of many resource allocation problems addressed in literature. In both these …
Proceedings Of The Sixth International Natural Language Generation Conference (Inlg 2010)., John D. Kelleher, Brian Mac Namee, Ielka Van Der Sluis
Proceedings Of The Sixth International Natural Language Generation Conference (Inlg 2010)., John D. Kelleher, Brian Mac Namee, Ielka Van Der Sluis
Conference papers
No abstract provided.
A First Practical Algorithm For High Levels Of Relational Consistency, Shant Karakashian, Robert J. Woodward, Christopher Reesons, Berthe Y. Choueiry, Christian Bessiere
A First Practical Algorithm For High Levels Of Relational Consistency, Shant Karakashian, Robert J. Woodward, Christopher Reesons, Berthe Y. Choueiry, Christian Bessiere
School of Computing: Conference and Workshop Papers
Consistency properties and algorithms for achieving them are at the heart of the success of Constraint Programming. In this paper, we study the relational consistency property R(∗,m)C, which is equivalent to m-wise consistency proposed in relational databases. We also define wR(∗,m)C, a weaker variant of this property. We propose an algorithm for enforcing these properties on a Constraint Satisfaction Problem by tightening the existing relations and without introducing new ones. We empirically show that wR(∗,m)C solves in a backtrack-free manner all the instances of some CSP benchmark classes, thus hinting at the tractability of those classes.
Effective Heuristic Methods For Finding Non-Optimal Solutions Of Interest In Constrained Optimization Models, Steven O. Kimbrough, Ann Kuo, Hoong Chuin Lau
Effective Heuristic Methods For Finding Non-Optimal Solutions Of Interest In Constrained Optimization Models, Steven O. Kimbrough, Ann Kuo, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
This paper introduces the SoI problem, that of finding nonoptimal solutions of interest for constrained optimization models. SoI problems subsume finding FoIs (feasible solutions of interest), and IoIs (infeasible solutions of interest). In all cases, the interest addressed is post-solution analysis in one form or another. Post-solution analysis of a constrained optimization model occurs after the model has been solved and a good or optimal solution for it has been found. At this point, sensitivity analysis and other questions of import for decision making (discussed in the paper) come into play and for this purpose the SoIs can be of …
Faceted Topic Retrieval Of News Video Using Joint Topic Modeling Of Visual Features And Speech Transcripts, Kong-Wah Wan, Ah-Hwee Tan, Joo-Hwee Lim, Liang-Tien Chia
Faceted Topic Retrieval Of News Video Using Joint Topic Modeling Of Visual Features And Speech Transcripts, Kong-Wah Wan, Ah-Hwee Tan, Joo-Hwee Lim, Liang-Tien Chia
Research Collection School Of Computing and Information Systems
Because of the inherent ambiguity in user queries, an important task of modern retrieval systems is faceted topic retrieval (FTR), which relates to the goal of returning diverse or novel information elucidating the wide range of topics or facets of the query need. We introduce a generative model for hypothesizing facets in the (news) video domain by combining the complementary information in the visual keyframes and the speech transcripts. We evaluate the efficacy of our multimodal model on the standard TRECVID-2005 video corpus annotated with facets. We find that: (1) the joint modeling of the visual and text (speech transcripts) …
Mental Development And Representation Building Through Motivated Learning, Janusz Starzyk, Pawel Raif, Ah-Hwee Tan
Mental Development And Representation Building Through Motivated Learning, Janusz Starzyk, Pawel Raif, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Motivated learning is a new machine learning approach that extends reinforcement learning idea to dynamically changing, and highly structured environments. In this approach a machine is capable of defining its own objectives and learns to satisfy them though an internal reward system. The machine is forced to explore the environment in response to externally applied negative (pain) signals that it must minimize. In doing so, it discovers relationships between objects observed through its sensory inputs and actions it performs on the observed objects. Observed concepts are not predefined but are emerging as a result of successful operations. For the optimum …
Anytime Planning For Decentralized Pomdps Using Expectation Maximization, Akshat Kumar, Shlomo Zilberstein
Anytime Planning For Decentralized Pomdps Using Expectation Maximization, Akshat Kumar, Shlomo Zilberstein
Research Collection School Of Computing and Information Systems
Decentralized POMDPs provide an expressive framework for multi-agent sequential decision making. While finite-horizon DECPOMDPs have enjoyed signifcant success, progress remains slow for the infinite-horizon case mainly due to the inherent complexity of optimizing stochastic controllers representing agent policies. We present a promising new class of algorithms for the infinite-horizon case, which recasts the optimization problem as inference in a mixture of DBNs. An attractive feature of this approach is the straightforward adoption of existing inference techniques in DBNs for solving DEC-POMDPs and supporting richer representations such as factored or continuous states and actions. We also derive the Expectation Maximization (EM) …
A Study Of Three Artificial Neural Networks Models' Ability To Identify Emotions From Facial Images, Timothy Scott Hyde
A Study Of Three Artificial Neural Networks Models' Ability To Identify Emotions From Facial Images, Timothy Scott Hyde
Theses and Dissertations
Facial expressions conveying emotions are vital for human communication. They are also important in the studies of human interaction and behavioral studies. Recognition of emotions, using facial images, may provide a fast and practical approach that is noninvasive. Most previous studies of emotion recognition through facial images were based on the Facial Action Coding System (FACS). The FACS, which was developed by Ekman and Freisen in 1978, was created to identify different facial muscular actions. Previous artificial neural network-based approaches for classification of facial expressions focused on improving one particular neural network model for better accuracy. The purpose of this …
Handling Concept Drift In Text Data Stream Constrained By High Labelling Cost, Patrick Lindstrom, Sarah Jane Delany, Brian Mac Namee
Handling Concept Drift In Text Data Stream Constrained By High Labelling Cost, Patrick Lindstrom, Sarah Jane Delany, Brian Mac Namee
Conference papers
In many real-world classification problems the concept being modelled is not static but rather changes over time - a situation known as concept drift. Most techniques for handling concept drift rely on the true classifications of test instances being available shortly after classification so that classifiers can be retrained to handle the drift. However, in applications where labelling instances with their true class has a high cost this is not reasonable. In this paper we present an approach for keeping a classifier up-to-date in a concept drift domain which is constrained by a high cost of labelling. We use …
Architecture Optimization, Training Convergence And Network Estimation Robustness Of A Fully Connected Recurrent Neural Network, Xiaoyu Wang
All Dissertations
Recurrent neural networks (RNN) have been rapidly developed in recent years. Applications of RNN can be found in system identification, optimization, image processing, pattern reorganization, classification, clustering, memory association, etc.
In this study, an optimized RNN is proposed to model nonlinear dynamical systems. A fully connected RNN is developed first which is modified from a fully forward connected neural network (FFCNN) by accommodating recurrent connections among its hidden neurons. In addition, a destructive structure optimization algorithm is applied and the extended Kalman filter (EKF) is adopted as a network's training algorithm. These two algorithms can seamlessly work together to generate …
Point-Based Backup For Decentralized Pompds: Complexity And New Algorithms, Akshat Kumar, Shlomo Zilberstein
Point-Based Backup For Decentralized Pompds: Complexity And New Algorithms, Akshat Kumar, Shlomo Zilberstein
Research Collection School Of Computing and Information Systems
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up existing algorithms, largely due to the use of point-based methods. Performing point-based backup is a fundamental operation in state-of-the-art algorithms. We show that even a single backup step in the multi-agent setting is NP-Complete. Despite this negative worst-case result, we present an efficient and scalable optimal algorithm as well as a principled approximation scheme. The optimal algorithm exploits recent advances in the weighted CSP literature to overcome the complexity of the backup operation. The polytime approximation scheme …
Towards Finding Robust Execution Strategies For Rcpsp/Max With Durational Uncertainty, Na Fu, Pradeep Varakantham, Hoong Chuin Lau
Towards Finding Robust Execution Strategies For Rcpsp/Max With Durational Uncertainty, Na Fu, Pradeep Varakantham, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Resource Constrained Project Scheduling Problems with minimum and maximum time lags (RCPSP/max) have been studied extensively in the literature. However, the more realistic RCPSP/max problems — ones where durations of activities are not known with certainty – have received scant interest and hence are the main focus of the paper. Towards addressing the significant computational complexity involved in tackling RCPSP/max with durational uncertainty, we employ a local search mechanism to generate robust schedules. In this regard, we make two key contributions: (a) Introducing and studying the key properties of a new decision rule to specify start times of activities with …
Optimization And Analysis Of A Robotic Navigational Algorithm, Derek Carlson, Joshua Brown Kramer, Faculty Advisor
Optimization And Analysis Of A Robotic Navigational Algorithm, Derek Carlson, Joshua Brown Kramer, Faculty Advisor
John Wesley Powell Student Research Conference
The problem of robot navigation involves planning a path to move a robot from a start point to a known target point within an obstacle course. The efficiency of such an algorithm can be measured in several ways. For instance, Lumelsky and Stepanov measure the length of the path taken in terms of obstacle perimeters. Gabriely and Rimon compare their two-dimensional algorithm's efficiency to that of the optimal algorithm. Brown Kramer and Sabalka expand upon the work of Gabriely and Rimon to produce an algorithm for dimensions greater than two. The primary objective of this research was to implement improvements …