This review systematically examines the progression of the You Only Look Once (YOLO) object detection algorithms from YOLOv1 to the recently unveiled YOLOv10. Employing a reverse chronological analysis, this study examines the advancements introduced by YOLO algorithms, beginning with YOLOv10 and progressing through YOLOv9, YOLOv8, and subsequent versions to explore each version's contributions to enhancing speed, accuracy, and computational efficiency in real-time object detection. The study highlights the transformative impact of YOLO across five critical application areas: automotive safety, healthcare, industrial manufacturing, surveillance, and agriculture. By detailing the incremental technological advancements that each iteration brought, this review not only chronicles the evolution of YOLO but also discusses the challenges and limitations observed in each earlier versions. The evolution signifies a path towards integrating YOLO with multimodal, context-aware, and General Artificial Intelligence (AGI) systems for the next YOLO decade, promising significant implications for future developments in AI-driven applications.

We introduce the Concept-Model-Graph-View Cycle (CMGVC). The CMGVC facilitates coherent architecture analysis, reasoning, insight, and decision-making based on conceptual models that are transformed into a generic, robust graph data structure (GDS). The GDS is then transformed into multiple views of the model, which inform stakeholders in various ways. This GDS-based approach decouples the view from the model and constitutes a powerful enhancement of model-based systems engineering (MBSE). The CMGVC applies the rigorous foundations of Category Theory, a mathematical framework of representations and transformations. We show that modeling languages are categories, drawing an analogy to programming languages. The CMGVC architecture is superior to direct transformations and language-coupled common representations. We demonstrate the CMGVC to transform a conceptual system architecture model built with the Object Process Modeling Language (OPM) into dual graphs and a stakeholder-informing matrix that stimulates system architecture insight.

This paper presents a comprehensive comparative analysis of four different computational vision algorithms for implementing an unpalleting system in a factory environment, under typical edge computing constraints. The primary objective is to automate the process of detecting and locating specific variable-shaped objects on a pallet, enabling a robotic system to accurately unstack them. The four algorithms evaluated are Pattern Matching, Scale-Invariant Feature Transform, Oriented FAST and Rotated BRIEF, and Haar cascade classifiers. Each technique is described in detail in this paper, and their implementations are outlined. Experimental results are thoroughly analyzed, assessing the algorithms’ performance based on accuracy, robustness to variability, computational speed, detection sensitivity, and resource consumption. The findings reveal the strengths and limitations of each algorithm, providing valuable insights for selecting the most appropriate technique based on the specific requirements of the unpalleting system. This research contributes to the advancement of automated object detection and localization in industrial environments, paving the way for more efficient and reliable unpalleting systems.

This study explores the integration of Artificial Intelligence (AI) and collaborative robotics in industrial surface finishing, focusing on feature detection on object reflective surfaces using neural networks in computationally constrained environments. Central to this investigation is the utilization of cameras considered as sensors that can capture detailed images of reflective surfaces. These images are then analyzed by a custom neural network, demonstrating the feasibility of feature detection with non-powerful computers. The public dataset for recognizing light reflection defects, available in the SPADD repository, supports this approach. Employing open-source tools like Darknet YOLOv3 and Yolo\_mark, this method proves particularly advantageous for small and medium-sized enterprises (SMEs) due to its low cost and maintenance requirements. This research highlights the challenges of AI and collaborative robotics in industrial applications, especially in adapting to varying conditions and the need for continuous training with new data coming from several sensors. Looking ahead, plans are in place to integrate this system with cobot-assisted polishing tasks, using cameras to enhance manufacturing efficiency and quality. This work contributes to the broader understanding of practical applications of AI in industrial automation, surface finishing processes, and the effective use of sensor technology.

Following technological advances, autonomous and remote-controlled ships are performing trials in some sea areas; a mandatory goal-based MASS code, expected to enter into force on 1 January 2032, is under discussion in the International Maritime Organization (IMO). However, there are no unified standards regarding verification methods to define operating limitations for cutting-edge technologies, which are expected to be elements of MASS, so it is difficult to assess the risk factors for the management and operation of MASS. This paper outlines the regulatory framework for MASS, followed by a discussion of its application, considering the differences between MASS and automated driving, and how to develop safety management and operation using standards for automated driving. A requirements management framework developed as a system and software engineering standards to build safety management and operation of MASS is proposed. It is also suggested that the requirements management framework could be used not only for MASS development but also for regulatory review from a requirements management view.

After proving, in a purely categorial way, that the inclusion functor InAlg(Σ) from Alg(Σ), the category of many-sorted Σ-algebras, to PAlg(Σ), the category of many-sorted partial Σ-algebras, has a left adjoint FΣ, the (absolutely) free completion functor, we recall, in connection with the functor FΣ, the generalized recursion theorem of Schmidt, which we will also call the Schmidt construction. Next we define a category Cmpl(Σ), of Σ-completions, and prove that FΣ, labeled with its domain category and the unit of the adjunction of which it is a part, is a weakly initial object in it. Following this we associate to an ordered pair (α,f), where α=(K,γ,α) is a morphism of Σ-completions from F=(C,F,η) to G=(D,G,ρ) and f a homomorphism in D from the partial Σ-algebra A to the partial Σ-algebra B, a homomorphism ΥαG,0(f):Schα(f)B. We then prove that there exists an endofunctor, ΥαG,0, of Mortw(D), the twisted morphism category of D, thus showing the naturalness of the previous construction. Afterwards we prove that, for every Σ-completion G=(D,G,ρ), there exists a functor ΥG from the comma category (Cmpl(Σ)↓G) to End(Mortw(D)), the category of endofunctors of Mortw(D), such that ΥG,0, the object mapping of ΥG, sends a morphism of Σ-completion in Cmpl(Σ) with codomain G, to the endofunctor ΥαG,0.